The optimization strategy for query evaluation in RDB/V1

Authors:
Akifumi Makinouchi;Masayoshi Tezuka;Hajime Kitakami;S. Adachi
Affiliations:
-;-;-;-
Venue:
VLDB '81 Proceedings of the seventh international conference on Very Large Data Bases - Volume 7
Year:
1981

Citing 8
Cited 1

Optimization of query evaluation algorithms

ACM Transactions on Database Systems (TODS)
Extending the database relational model to capture more meaning

ACM Transactions on Database Systems (TODS)
System R: relational approach to database management

ACM Transactions on Database Systems (TODS)
Decomposition—a strategy for query processing

ACM Transactions on Database Systems (TODS)
Relational Database Systemsr

ACM Computing Surveys (CSUR)
Optimizing the performance of a relational algebra database interface

Communications of the ACM
A relational model of data for large shared data banks

Communications of the ACM
Access path selection in a relational database management system

SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data

IBM database 2 performance: design, implementation, and tuning

IBM Systems Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

RDB/V1 is a fully relational database managenent system that has been developed for end users. In implementing the system, we focused our efforts upon making the system easy to use and efficient in query evaluation. This paper deals with how to gain efficiency in query evaluation; that is, optimization of query evaluation. Our approach for optimization is a heuristic one. Some of the characteristics of our approach are: (1) access cost evaluation based on statistical data, (2) dynamic gathering of data for use in speeding up join operation, (3) integration of facility for optimization into the view mechanism, and (4) global optimization after local optimization.