Optimization of distributed tree queries
From MaRDI portal
Publication:801699
Recommendations
Cites work
Cited in
(20)- Tree pattern query minimization
- Distributed tree comparison with nodes of limited memory
- Properties of semijoin sequences
- Asserting the optimality of serial SJRPs in processing simple queries in chain networks
- Taxonomy and formal properties of distributed joins
- On the reusability of query optimization algorithms
- Strategies for distributed query optimization
- Weighted hypertree decompositions and optimal query plans
- Distributed Relationship Schemes for Trees
- Composite semijoins in distributed query processing
- On Determining Tree Query Membership Of A Distributed Query
- An Optimal Algorithm for Processing Distributed Star Queries
- Improvement Algorithms for Semijoin Query Processing Programs in Distributed Database Systems
- A graph-theoretic model for optimizing queries involving methods
- scientific article; zbMATH DE number 822167 (Why is no real title available?)
- Distributed search trees: fault tolerance in an asynchronous environment
- On the Matter of Dynamic Optimality in an Extended Model for Tree Access Operations
- Forward node-selecting queries over trees
- An algorithm for handling many relational calculus queries efficiently.
- Uniform Constraint Satisfaction Problems and Database Theory
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)