Abstract

Database management systems will continue to manage large data volumes. Thus, efficient algorithms for accessing and manipulating large sets and sequences will be required to provide acceptable performance. The advent of object-oriented and extensible database systems will not solve this problem. On the contrary, modern data models exacerbate it: In order to manipulate large sets of complex objects as efficiently as today’s database systems manipulate simple records, query processing algorithms and software will become more complex, and a solid understanding of algorithm and architectural issues is essential for the designer of database management software. This survey provides a foundation for the design and implementation of query execution facilities in new database management systems. It describes a wide array of practical query evaluation techniques for both relational and post-relational database systems, including iterative execution of complex query evaluation plans, the duality of sort- and hash-based set matching algorithms, types of parallel query execution and their implementation, and special operators for emerging database application domains.

Citations

1969	R-trees: a dynamic index structure for spatial searching - Guttman - 1984
1185	Space/time trade-offs in hash coding with allowable errors - Bloom - 1970
1128	The C Programming Language - Kernighan, Ritchie - 1988
957	Larson J: Federated Database Systems for Managing Distributed - Sheth - 1990
910	Multidimensional binary search trees used for associative binary searching - Bentley - 1975
808	The design and implementation of a log-structured file system - Rosenblum, Ousterhout - 1991
590	Universal classes of hash functions - CARTER, WEGMAN - 1979
501	The ubiquitous B-tree - Comer - 1979
466	Parallel database systems: the future of high performance database systems,” Commun - DeWitt, Gray - 1992
404	On optimistic methods for concurrency control - Kung, Robinson
384	Theory of Relational Databases - Maier - 1983
371	The implementation of Postgres - Stonebraker, Rowe, et al. - 1990
363	The quadtree and related hierarchical data structures - Samet - 1984
362	The Grid File: An Adaptable, Symmetric Multikey File Structure, Trans. Database Systems 9,1 - Nievergelt, Hinterberger, et al. - 1984
343	The KDB tree: a search structure for large multidimensional dynamic indexes - Robinson - 1981
288	Why aren't operating systems getting faster as fast as hardware - Ousterhout - 1990
264	Security-control methods for statistical databases: a comparative study - Adam, Worthmann - 1989
258	The OO7 Benchmark - Carey - 1993
251	The functional data model and the data language DAPLEX - Shipman - 1981
222	Reuter A: Principles of transaction-oriented database recovery - Haerder - 1983
212	A dichromatic framework for balanced trees - Guibas, Sedgewick - 1978
212	Operating System Support for Database Management - Stonebraker - 1981
208	and J.L.Bentley. Quad trees: a data structure for retrieval on composite keys - Finkel - 1974
203	The Gamma Database Machine Project - DeWitt - 1990
188	Join indices - Valduriez - 1987
180	Toward a unified framework for version modeling in engineering databases - Katz - 1990
170	I.,(1986) “Join Processing in Database Systems with Large Main Memories - Shapiro
167	The hb-tree: a multiattribute indexing method with good guaranteed performance - Lomet, Salzberg - 1990
160	The Entity Relationship Model - Toward a Unified View of Data - Chen - 1976
160	The Relational Model with Relation-Valued Attributes - Schek, Scholl - 1986
159	Dataflow query execution in a parallel mainmemory environment - WILSCHUT, APERS - 1991
155	Indexing in an ObjectOriented DBMS - Maier, Stein - 1986
155	e design of the POSTGRES storage system - Stonebraker
153	The EXODUS Optimizer Generator - Graefe, DeWitt - 1987
151	Updating derived relations: detecting irrelevant and autonomously computable updates - Blakeley, Coburn, et al. - 1989
149	An evaluation of buffer management strategies for relational database systems - Chou, DeWitt - 1985
147	A performance evaluation of four parallel join algorithms in a shared-nothing multiprocessor environment - Schneider, DeWitt - 1989
132	System R relational approach to database management - Astrahan - 1976
131	Implementation of Integrity Constraints and Views by Query Modification - Stonebraker - 1975
130	Logic and Databases: A Deductive Approach - Gallaire, Minker, et al. - 1984
128	Dynamic Query Evaluation Plans - Graefe, Ward
128	Equivalence of Relational Algebra and Relational Calculus Query Languages Having Aggregate Functions - Klug - 1982
128	Beating the I/O Bottleneck: A Case for LogStructured File Systems - Ousterhout, Douglis - 1989
121	A retrieval technique for similar shape - Jagadish - 1991
117	Prototyping Bubba, A Highly Parallel Database System - Boral - 1990
116	Indexing Techniques for Queries on Nested Objects - Bertino, Kim - 1989
116	Fido: A cache that learns to fetch - Palmer, Zdonik - 1991
114	Optimization of nonrecursive queries - Krishnamurthy, Boral, et al. - 1986
113	Query Optimization for Parallel Execution - Ganguly, Hasan, et al. - 1992
112	Chained declustering: A new availability strategy for multi-processor database machines - Hsiao, DeWitt - 1990