Optimization of distributed tree queries
From MaRDI portal
Publication:801699
DOI10.1016/0022-0000(84)90007-2zbMATH Open0552.68085OpenAlexW2009020789MaRDI QIDQ801699FDOQ801699
Authors: N. E. Zubov
Publication date: 1984
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-0000(84)90007-2
Recommendations
algorithmdistributed database management systemsoptimum semi-join strategytotal time minimizationtree queries
Cites Work
Cited In (20)
- An algorithm for handling many relational calculus queries efficiently.
- A graph-theoretic model for optimizing queries involving methods
- Distributed tree comparison with nodes of limited memory
- Improvement Algorithms for Semijoin Query Processing Programs in Distributed Database Systems
- Distributed search trees: fault tolerance in an asynchronous environment
- Uniform Constraint Satisfaction Problems and Database Theory
- Properties of semijoin sequences
- Tree pattern query minimization
- Weighted hypertree decompositions and optimal query plans
- Composite semijoins in distributed query processing
- Title not available (Why is that?)
- On the reusability of query optimization algorithms
- Strategies for distributed query optimization
- Forward node-selecting queries over trees
- On Determining Tree Query Membership Of A Distributed Query
- On the Matter of Dynamic Optimality in an Extended Model for Tree Access Operations
- Asserting the optimality of serial SJRPs in processing simple queries in chain networks
- Distributed Relationship Schemes for Trees
- Taxonomy and formal properties of distributed joins
- An Optimal Algorithm for Processing Distributed Star Queries
Uses Software
This page was built for publication: Optimization of distributed tree queries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q801699)