On Determining Tree Query Membership Of A Distributed Query

DOI10.1080/03155986.1984.11731927zbMath0547.68098OpenAlexW2397672765MaRDI QIDQ3339330

Z. Meral Ozsoyoglu, Clement Yu

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)

Related Items

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, 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, Optimization of distributed tree queries