High level performance estimate of relational queries
Performance estimate of queries is a necessary part of any efficient database design methodology. A high-level performance estimator for relational queries is presented which is different from conventional evaluators such as SYSTEM R (Selinger, Proc. SIGMOD 79) in that performance is predicted without the details of the low-level constructs such as links and indices. Rather, abstractions and reasonable assumptions of these low-level constructs are used in a set of formulas to estimate the performance of a set of queries against a schema. The major results of the paper are the realization and motivation of the need of high-level performance estimators of this kind, and a fast way to estimate the cost of N-way joins. The second result is interesting in that the algorithm for N-way joins is found to be similar to matrix multiplication optimization, with straightforward extensions.
- Research Organization:
- California Univ., Berkeley (USA). Lawrence Berkeley Lab.
- DOE Contract Number:
- W-7405-ENG-48
- OSTI ID:
- 6997423
- Report Number(s):
- LBL-11298; CONF-801205-1
- Resource Relation:
- Conference: International computer symposium on software development: methodology and management, Taipei, Taiwan, China, 16 Dec 1980
- Country of Publication:
- United States
- Language:
- English
Similar Records
Relational aggregate query processing techniques for real-time databases
Query optimization in distributed databases