On Determining Tree Query Membership Of A Distributed Query

DOI10.1080/03155986.1984.11731927MaRDI QIDQ3339330zbMATH OpenOpenAlexFDO

Authors Clement Yu, Z. Meral Ozsoyoglu

Publication date 1984

Published in INFOR: Information Systems and Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/03155986.1984.11731927

zbMATH Keywords

algorithmdistributed relational databasetree queriescommunication costdistributed queriesamount of data transmissionsemi-joints

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20)

Recommendations

• Optimization of distributed tree queries
• A distributed join algorithm
• Improvement Algorithms for Semijoin Query Processing Programs in Distributed Database Systems
• Composite semijoins in distributed query processing
• The tree projection theorem and relational query processing

Cited in

(10)

• Distributed tree comparison with nodes of limited memory
• A characterization of finite fd-acyclicity
• Uniform Constraint Satisfaction Problems and Database Theory
• Hypertree decompositions and tractable queries
• The tree projection theorem and relational query processing
• Optimization of distributed tree queries
• NP-complete problems simplified on tree schemas
• Acyclic join dependency and data base projections
• Distributed Relationship Schemes for Trees
• GYO reductions, canonical connections, tree and cyclic schemas, and tree projections

This page was built for publication: On Determining Tree Query Membership Of A Distributed Query

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