Tree queries

DOI10.1145/319758.319775zbMath0493.68101OpenAlexW1977735896MaRDI QIDQ3956441

Oded Shmueli, Nathan Goodman

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

joinrelational databasequery processingcyclic schemastree schemassemijoinacyclic schemescyclic schemes

Mathematics Subject Classification ID

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

Related Items

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