Optimization of distributed tree queries
In this paper the problem of finding an optimum strategy of semi-joins for solving tree queries is studied under the objective of total time minimization. Tree queries that are conjunctions of equi-join clauses such that any two relations in the query have at most one attribute in common are considered. This class of tree queries is a superset of classes of tree queries, such as chain queries and simple queries, that have been studied for semi-join optimization in the literature. An algorithm based on dynamic programming to find the optimum semi-join strategy for a given query is presented. The search space for finding the optimum is reduced by eliminating strategies that can never be the optimum. This is accomplished by utilizing a set of properties that a potentially optimum strategy should satisfy.
- Asserting the optimality of serial SJRPs in processing simple queries in chain networks
- Taxonomy and formal properties of distributed joins
- Properties of semijoin sequences
- A graph-theoretic model for optimizing queries involving methods
- Distributed search trees: fault tolerance in an asynchronous environment
- Tree pattern query minimization
- An algorithm for handling many relational calculus queries efficiently.
- Improvement Algorithms for Semijoin Query Processing Programs in Distributed Database Systems
- On Determining Tree Query Membership Of A Distributed Query
- Forward node-selecting queries over trees
- An Optimal Algorithm for Processing Distributed Star Queries
- scientific article; zbMATH DE number 1239811 (Why is no real title available?)
- scientific article; zbMATH DE number 822167 (Why is no real title available?)
- On the Matter of Dynamic Optimality in an Extended Model for Tree Access Operations
- Distributed tree comparison with nodes of limited memory
- Distributed Relationship Schemes for Trees
- Uniform Constraint Satisfaction Problems and Database Theory
- Composite semijoins in distributed query processing
- On the reusability of query optimization algorithms
- Strategies for distributed query optimization
- Weighted hypertree decompositions and optimal query plans
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)