Pages that link to "Item:Q801699"
From MaRDI portal
The following pages link to Optimization of distributed tree queries (Q801699):
Displaying 17 items.
- Composite semijoins in distributed query processing (Q749211) (← links)
- On the reusability of query optimization algorithms (Q750138) (← links)
- Strategies for distributed query optimization (Q751266) (← links)
- Weighted hypertree decompositions and optimal query plans (Q878759) (← links)
- Asserting the optimality of serial SJRPs in processing simple queries in chain networks (Q1061509) (← links)
- Taxonomy and formal properties of distributed joins (Q1072721) (← links)
- Properties of semijoin sequences (Q1263978) (← links)
- A graph-theoretic model for optimizing queries involving methods (Q1606734) (← links)
- Distributed search trees: fault tolerance in an asynchronous environment (Q1762993) (← links)
- Tree pattern query minimization (Q1811333) (← links)
- An algorithm for handling many relational calculus queries efficiently. (Q1872707) (← links)
- Forward node-selecting queries over trees (Q3549130) (← links)
- (Q4856304) (← links)
- On the Matter of Dynamic Optimality in an Extended Model for Tree Access Operations (Q5199262) (← links)
- Distributed tree comparison with nodes of limited memory (Q5326772) (← links)
- Distributed Relationship Schemes for Trees (Q5387807) (← links)
- Uniform Constraint Satisfaction Problems and Database Theory (Q5504703) (← links)