Smalltalk-80: the language and its implementation
Smalltalk-80: the language and its implementation
Distributed databases principles and systems
Distributed databases principles and systems
ACM Computing Surveys (CSUR)
An introduction to database systems: vol. I (4th ed.)
An introduction to database systems: vol. I (4th ed.)
A state transition model for distributed query processing
ACM Transactions on Database Systems (TODS)
Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
Load balancing in a locally distributed DB system
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
Theory of linear and integer programming
Theory of linear and integer programming
Relational Information Systems
Relational Information Systems
Introduction to operations research, 4th ed.
Introduction to operations research, 4th ed.
Concurrency control performance modeling: alternatives and implications
ACM Transactions on Database Systems (TODS)
Locking performance in centralized databases
Locking performance in centralized databases
The status of nonlinear programming software: an update
Operations Research
Stochastic query optimization in distributed databases
Stochastic query optimization in distributed databases
Using Semi-Joins to Solve Relational Queries
Journal of the ACM (JACM)
On Communicating Finite-State Machines
Journal of the ACM (JACM)
A relational model of data for large shared data banks
Communications of the ACM
Data Structures and Algorithms
Data Structures and Algorithms
R* Optimizer Validation and Performance Evaluation for Distributed Queries
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
A simulation-based approach for dynamic process management at web service platforms
Computers and Industrial Engineering
A simulation-based approach for dynamic process management at web service platforms
Computers and Industrial Engineering
| Hi-index | 0.00 |
Many algorithms have been devised for minimizing the costs associated with obtaining the answer to a single, isolated query in a distributed database system. However, if more than one query may be processed by the system at the same time and if the arrival times of the queries are unknown, the determination of optimal query-processing strategies becomes a stochastic optimization problem. In order to cope with such problems, a theoretical state-transition model is presented that treats the system as one operating under a stochastic load. Query-processing strategies may then be distributed over the processors of a network as probability distributions, in a manner which accommodates many queries over time.It is then shown that the model leads to the determination of optimal query-processing strategies as the solution of mathematical programming problems, and analytical results for several examples are presented. Furthermore, a divide-and-conquer approach is introduced for decomposing stochastic query optimization problems into distinct subproblems for processing queries sequentially and in parallel.