Encapsulation of parallelism in the Volcano query processing system
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
A performance evaluation of pointer-based joins
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
A general framework for the optimization of object-oriented queries
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Parallel evaluation of multi-join queries
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Polar: an architecture for a parallel ODMG compliant object database
Proceedings of the ninth international conference on Information and knowledge management
Approximating block accesses in database organizations
Communications of the ACM
Parallel Pointer-Based Join Algorithms in Memory-mapped Environments
ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
Pointer-Based Join Techniques for Object-Oriented Databases
PDIS '93 Proceedings of the 2nd International Conference on Parallel and Distributed Information Systems
The VLDB Journal — The International Journal on Very Large Data Bases
Data placement in shared-nothing parallel database systems
The VLDB Journal — The International Journal on Very Large Data Bases
A Parallel Algebra for Object Databases
DEXA '99 Proceedings of the 10th International Workshop on Database & Expert Systems Applications
The Design, Implementation and Evaluation of an ODMG Compliant, Parallel Object Database Server
Distributed and Parallel Databases
Resource Scheduling for Parallel Query Processing on Computational Grids
GRID '04 Proceedings of the 5th IEEE/ACM International Workshop on Grid Computing
Self-monitoring query execution for adaptive query processing
Data & Knowledge Engineering
A novel approach to resource scheduling for parallel query processing on computational grids
Distributed and Parallel Databases
| Hi-index | 0.00 |
Query cost models are widely used, both for performance analysis and for comparing execution plans during query optimisation. In essence, a cost modelp redicts where time is being spent during query evaluation. Although many cost models have been proposed, for serial, parallel and distributed database systems, surprisingly few of these have been validated against real systems. This paper presents cost models for the parallel evaluation of ODMG OQL queries, which have been compared with experimental results obtained using the Polar object database system. The paper describes the validation of the cost model for a collection of queries, using three join algorithms over the OO7 benchmark database. The results show that the cost model generally both ranks alternative plans appropriately, and gives a useful indication of the response times that can be expected from a plan. The paper also illustrates the application of the cost model by highlighting the contributions of different features and operations to query response times.