The tree projection theorem and relational query processing

DOI10.1016/0022-0000(84)90076-XzbMath0571.68086MaRDI QIDQ1061514

Nathan Goodman, Oded Shmueli

Publication date: 1984

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

zbMATH Keywords

natural join queriesrelational database schemastree schema

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20)

Related Items (6)

The Power of Local Consistency in Conjunctive Queries and Constraint Satisfaction Problems ⋮ Tree projections and constraint optimization problems: fixed-parameter tractability and parallel algorithms ⋮ Greedy strategies and larger islands of tractability for conjunctive queries and constraint satisfaction problems ⋮ Tree Projections: Game Characterization and Computational Aspects ⋮ Structural tractability of enumerating CSP solutions ⋮ GYO reductions, canonical connections, tree and cyclic schemas, and tree projections

Uses Software

• INGRES

Cites Work

• Unnamed Item
• Connections in acyclic hypergraphs
• Acyclic join dependency and data base projections
• NP-complete problems simplified on tree schemas
• On the Desirability of Acyclic Database Schemes
• Degrees of acyclicity for hypergraphs and relational database schemes
• Syntactic Characterization of Tree Database Schemas
• Maximal objects and the semantics of universal relation databases
• On Determining Tree Query Membership Of A Distributed Query
• Using Semi-Joins to Solve Relational Queries
• Power of Natural Semijoins
• A simplied universal relation assumption and its properties
• Tree queries
• Equivalences among Relational Expressions

This page was built for publication: The tree projection theorem and relational query processing