Distributed databases principles and systems
Distributed databases principles and systems
Optimizing chain queries in a distributed database system.
SIAM Journal on Computing
Optimization of distributed tree queries
Journal of Computer and System Sciences
ACM Computing Surveys (CSUR)
Artificial intelligence
Join and Semijoin Algorithms for a Multiprocessor Database Machine
ACM Transactions on Database Systems (TODS)
Query processing in a system for distributed databases (SDD-1)
ACM Transactions on Database Systems (TODS)
Tree queries: a simple class of relational queries
ACM Transactions on Database Systems (TODS)
Using Semi-Joins to Solve Relational Queries
Journal of the ACM (JACM)
Distributed query processing in a relational data base system
SIGMOD '78 Proceedings of the 1978 ACM SIGMOD international conference on management of data
A methodology for interpreting tree queries into optimal semi-join expressions
SIGMOD '80 Proceedings of the 1980 ACM SIGMOD international conference on Management of data
Optimizing Star Queries in a Distributed Database System
VLDB '84 Proceedings of the 10th International Conference on Very Large Data Bases
Models of a very large distributed database
SIGCOMM '87 Proceedings of the ACM workshop on Frontiers in computer communications technology
Dynamic distributed query processing techniques
CSC '89 Proceedings of the 17th conference on ACM Annual Computer Science Conference
Stochastic query optimization in distributed databases
ACM Transactions on Database Systems (TODS)
Hypergraph based reorderings of outer join queries with complex predicates
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Adaptive Algorithms for Join Processing in Distributed Database Systems
Distributed and Parallel 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
Correcting execution of distributed queries
DPDS '90 Proceedings of the second international symposium on Databases in parallel and distributed systems
Using differential techniques to efficiently support transaction time
The VLDB Journal — The International Journal on Very Large Data Bases
An Intelligent Search Method for Query Optimization by Semijoins
IEEE Transactions on Knowledge and Data Engineering
Deciding to Correct Distributed Query Processing
IEEE Transactions on Knowledge and Data Engineering
A Graph Theoretical Approach to Determine a Join Reducer Sequence in Distributed Query Processing
IEEE Transactions on Knowledge and Data Engineering
On the Complexity of Distributed Query Optimization
IEEE Transactions on Knowledge and Data Engineering
Interleaving a Join Sequence with Semijoins in Distributed Query Processing
IEEE Transactions on Parallel and Distributed Systems
The Effect of Index Partitioning Schemes on the Performance of Distributed Query Processing
IEEE Transactions on Knowledge and Data Engineering
Combining Joint and Semi-Join Operations for Distributed Query Processing
IEEE Transactions on Knowledge and Data Engineering
No regression algorithm for the enumeration of projections in SQL queries with joins and outer joins
CASCON '95 Proceedings of the 1995 conference of the Centre for Advanced Studies on Collaborative research
Generating query plans for distributed query processing using genetic algorithm
ICICA'11 Proceedings of the Second international conference on Information Computing and Applications
Hi-index | 0.01 |
A state transition model for the optimization of query processing in a distributed database system is presented. The problem is parameterized by means of a state describing the amount of processing that has been performed at each site where the database is located. A state transition occurs each time a new join or semijoin is executed. Dynamic programming is used to compute recursively the costs of the states and the globally optimal solution, taking into account communication and local processing costs. The state transition model is general enough to account for the possibility of parallel processing among the various sites, as well as for redundancy in the database. The model also permits significant reductions of the necessary computations by taking advantage of simple additivity and site-uniformity properties of a cost model, and of clever strategies that improve on the basic dynamic programming algorithm.