Distributed databases principles and systems
Distributed databases principles and systems
On the optimal nesting order for computing N-relational joins
ACM Transactions on Database Systems (TODS)
Optimizing chain queries in a distributed database system.
SIAM Journal on Computing
Load balancing in a locally distributed DB system
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
Algorithms to Process Distributed Queries in Fast Local Networks
IEEE Transactions on Computers
Optimization of large join queries
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Dynamic query evaluation plans
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Optimization of large join queries: combining heuristics and combinatorial techniques
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
The effect of bucket size tuning in the dynamic hybrid GRACE hash join method
VLDB '89 Proceedings of the 15th international conference on Very large data bases
Principles of distributed database systems
Principles of distributed database systems
Randomized algorithms for optimizing large join queries
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
Adaptive query optimization in dynamic databases
Adaptive query optimization in dynamic databases
Using join operations as reducers in distributed query processing
DPDS '90 Proceedings of the second international symposium on Databases in parallel and distributed systems
Query processing in a system for distributed databases (SDD-1)
ACM Transactions on Database Systems (TODS)
Query optimization in star computer networks
ACM Transactions on Database Systems (TODS)
Using Semi-Joins to Solve Relational Queries
Journal of the ACM (JACM)
Principles of Database Systems
Principles of Database Systems
Hash-Based and Index-Based Join Algorithms for Cube and Ring Connected Multicomputers
IEEE Transactions on Knowledge and Data Engineering
A Polynomial Time Algorithm for Optimizing Join Queries
Proceedings of the Ninth International Conference on Data Engineering
Distributed Query Evaluation in Local Area Networks
Proceedings of the First International Conference on Data Engineering
Uniformly-Distributed Random Generation of Join Orders
ICDT '95 Proceedings of the 5th International Conference on Database Theory
On the Complexity of Generating Optimal Left-Deep Processing Trees with Cross Products
ICDT '95 Proceedings of the 5th International Conference on Database Theory
Optimizing Star Queries in a Distributed Database System
VLDB '84 Proceedings of the 10th International Conference on Very Large Data Bases
Optimization of Nonrecursive Queries
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
Querying in Highly Mobile Distributed Environments
VLDB '92 Proceedings of the 18th International Conference on Very Large Data Bases
Adaptive workload allocation in query processing in autonomous heterogeneous environments
Distributed and Parallel Databases
| Hi-index | 0.00 |
This paper addresses the problem of query optimization fordynamic databases in distributed environments where data frequently changetheir values. An adaptive query optimization algorithm is proposed toevaluate queries. Rather than constructing a full plan for an access path andexecuting it, the algorithm constructs a partial plan, executes it, updatesthe statistics, and constructs a new partial plan. Since a partial plan isconstructed based on the latest statistics, the algorithm is adaptive to data modifications and errors from the statistics. The algorithm extends the SDD-1algorithm by considering local processing cost as well as communication cost.Whereas the SDD-1 algorithm only uses semi-joins to reduce communication cost,the algorithm reduces it with joins as well. It is proved that the adaptivealgorithm is more efficient than the SDD-1 algorithm.