Tree queries

DOI10.1145/319758.319775MaRDI QIDQ3956441zbMATH OpenOpenAlexFDO

Authors Nathan Goodman, Oded Shmueli

Publication date 1982

Published in ACM Transactions on Database Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/319758.319775

zbMATH Keywords

joinquery processingrelational databasecyclic schemastree schemassemijoinacyclic schemescyclic schemes

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Theory of operating systems (68N25)

Cited in

(12)

• An algorithm for handling many relational calculus queries efficiently.
• Optimising the distributed execution of join queries in polynomial time
• A characterization of finite fd-acyclicity
• Uniform Constraint Satisfaction Problems and Database Theory
• Hypertree decompositions and tractable queries
• On hypergraph acyclicity and graph chordality
• The tree projection theorem and relational query processing
• Minimizing the response time of executing a join between fragmented relations in a distributed database system
• NP-complete problems simplified on tree schemas
• On the existence of acyclic views in a database scheme
• Acyclic join dependency and data base projections
• GYO reductions, canonical connections, tree and cyclic schemas, and tree projections

This page was built for publication: Tree queries

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