The tree projection theorem and relational query processing

DOI10.1016/0022-0000(84)90076-XMaRDI QIDQ1061514zbMATH OpenFDO

Authors 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)

Recommendations

• Acyclic join dependency and data base projections
• On Determining Tree Query Membership Of A Distributed Query
• Complexity of Views: Tree and Cyclic Schemas
• The complexity of evaluating relational queries
• Joins and solutions of the projection synthesis problem in relational databases. II

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A simplied universal relation assumption and its properties
• Acyclic join dependency and data base projections
• Connections in acyclic hypergraphs
• Degrees of acyclicity for hypergraphs and relational database schemes
• Equivalences among Relational Expressions
• Maximal objects and the semantics of universal relation databases
• NP-complete problems simplified on tree schemas
• On Determining Tree Query Membership Of A Distributed Query
• On the Desirability of Acyclic Database Schemes
• Power of Natural Semijoins
• Syntactic Characterization of Tree Database Schemas
• Tree queries
• Using Semi-Joins to Solve Relational Queries

Cited in

(9)

• Intersection graphs of \(k\)-acyclic families of subtrees and relational database query processing.
• Relational depth-first-search with applications
• Tree projections and constraint optimization problems: fixed-parameter tractability and parallel algorithms
• Tree projections: Game characterization and computational aspects
• On Determining Tree Query Membership Of A Distributed Query
• GYO reductions, canonical connections, tree and cyclic schemas, and tree projections
• Greedy strategies and larger islands of tractability for conjunctive queries and constraint satisfaction problems
• Structural tractability of enumerating CSP solutions
• The Power of Local Consistency in Conjunctive Queries and Constraint Satisfaction Problems

Describes a project that uses

Uses Software

• INGRES

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1061514)