Query Optimization in Database Systems
Matthias Jarke, Jurgen Koch · ACM Computing Surveys · 1984
Efficient methods of processing unanticipated queries are a crucial prerequisite for the success of generalized database management systems. A wide variety of approaches to improve the performance of query evaluation algorithms have been proposed: logic-based and semantic transformations, fast implementations of basic operations, and combinatorial or heuristic algorithms for generating alternative access plans and choosing among them. These methods are presented in the framework of a general query evaluation procedure using the relational calculus representation of queries. In addition, nonstandard query optimization issues such as higher level query evaluation, query optimization in distributed databases, and use of database machines are addressed. The focus, however, is on query optimization in centralized database systems.
Cited by 650 works. doi:10.1145/356924.356928
Authors
References
- The notions of consistency and predicate locks in a database system
- Principles of Artificial Intelligence
- Access path selection in a relational database management system
- The design and implementation of INGRES
- Organization and maintenance of large ordered indexes
- A data base sublanguage founded on the relational calculus
- The Grid File
- Data Structures for Range Searching
- Concurrency Control in Distributed Database Systems
- Implementation of integrity constraints and views by query modification