The DOI matches its Crossref record; 106 of the 106 references it cites were found in a registry or an index.
Query evaluation techniques for large databases
Open accessAbstract
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 the problem: 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 postrelational 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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Lecture Notes in Computer Science 1205
(1999) · Industrial Robot: An International Journal · doi:10.1108/ir.1999.04926fae.001 · Cited by 38,662
The Art of Computer Programming
Knuth, D. E. (1968) · Cited by 16,337
David, F. N., & Tukey, J. W. (1977) · Biometrics · doi:10.2307/2529486 · Cited by 12,708
Multidimensional binary search trees used for associative searching
Bentley, J. L. (1975) · Communications of the ACM · doi:10.1145/361002.361007 · Cited by 7,520
Space/time trade-offs in hash coding with allowable errors
Bloom, B. H. (1970) · Communications of the ACM · doi:10.1145/362686.362692 · Cited by 7,492
R-trees: a dynamic index structure for spatial searching
Guttman, A. (1984) · Proceedings of the 1984 ACM SIGMOD international conference on Management of data - SIGMOD '84 · doi:10.1145/602259.602266 · Cited by 6,580
The Entity Relationship Model — Toward a Unified View of Data
Chen, P. P.-S. (2002) · Software Pioneers · doi:10.1007/978-3-642-59412-0_18 · Cited by 5,751
The entity-relationship model—toward a unified view of data
Chen, P. P.-S. (1976) · ACM Transactions on Database Systems · doi:10.1145/320434.320440 · Cited by 4,708
Stroustrup, B. (1985) · Cited by 4,409
The R*-tree: an efficient and robust access method for points and rectangles
Beckmann, N., Kriegel, H.-P., Schneider, R., & Seeger, B. (1990) · Proceedings of the 1990 ACM SIGMOD international conference on Management of data · doi:10.1145/93597.98741 · Cited by 4,161
The Art of Computer Programming: Volume 3: Sorting and Searching
Knuth, D. E. (1973) · Cited by 3,955
Transaction Processing: Concepts and Techniques
Gray, J., & Reuter, A. (1992) · Cited by 3,000
Universal classes of hash functions
Carter, J. L., & Wegman, M. N. (1979) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(79)90044-8 · Cited by 2,519
Federated database systems for managing distributed, heterogeneous, and autonomous databases
Sheth, A. P., & Larson, J. A. (1990) · ACM Computing Surveys · doi:10.1145/96602.96604 · Cited by 2,476
Principles of Distributed Database Systems
Özsu, M. T., & Valduriez, P. (2020) · Springer eBooks · doi:10.1007/978-3-030-26253-2 · Cited by 2,345
A case for redundant arrays of inexpensive disks (RAID)
Patterson, D. A., Gibson, G., & Katz, R. H. (1988) · ACM SIGMOD Record · doi:10.1145/971701.50214 · Cited by 2,281
The Quadtree and Related Hierarchical Data Structures
Samet, H. (1984) · ACM Computing Surveys · doi:10.1145/356924.356930 · Cited by 2,205
Access path selection in a relational database management system
Selinger, P. G., Astrahan, M. M., Chamberlin, D. D., Lorie, R. A., & Price, T. G. (1979) · Proceedings of the 1979 ACM SIGMOD international conference on Management of data - SIGMOD '79 · doi:10.1145/582095.582099 · Cited by 2,188
Quad trees a data structure for retrieval on composite keys
Finkel, R. A., & Bentley, J. L. (1974) · Acta Informatica · doi:10.1007/bf00288933 · Cited by 2,041
Comer, D. (1979) · ACM Computing Surveys · doi:10.1145/356770.356776 · Cited by 1,859
Kernighan, B. W., & Ritchie, D. M. (1978) · Cited by 1,857
A comparative analysis of methodologies for database schema integration
Batini, C., Lenzerini, M., & Navathe, S. B. (1986) · ACM Computing Surveys · doi:10.1145/27633.27634 · Cited by 1,740
On optimistic methods for concurrency control
Kung, H. T., & Robinson, J. T. (1981) · ACM Transactions on Database Systems · doi:10.1145/319566.319567 · Cited by 1,439
Parallel database systems: the future of high performance database systems
DeWitt, D., & Gray, J. (1992) · Communications of the ACM · doi:10.1145/129888.129894 · Cited by 1,291
Hamming, R. W., & Stearns, S. D. (1977) · Cited by 1,275
Principles of transaction-oriented database recovery
Haerder, T., & Reuter, A. (1983) · ACM Computing Surveys · doi:10.1145/289.291 · Cited by 1,217
Concurrency Control in Distributed Database Systems
Bernstein, P. A., & Goodman, N. (1981) · ACM Computing Surveys · doi:10.1145/356842.356846 · Cited by 1,186
Semantic database modeling: survey, applications, and research issues
Hull, R., & King, R. (1987) · ACM Computing Surveys · doi:10.1145/45072.45073 · Cited by 1,146
System R: relational approach to database management
Astrahan, M. M., Blasgen, M. W., Chamberlin, D. D., Eswaran, K. P., Gray, J. N., Griffiths, P. P., King, W. F., Lorie, R. A., McJones, P. R., Mehl, J. W., et al. (1976) · ACM Transactions on Database Systems · doi:10.1145/320455.320457 · Cited by 1,044
Security-control methods for statistical databases: a comparative study
Adam, N. R., & Worthmann, J. C. (1989) · ACM Computing Surveys · doi:10.1145/76894.76895 · Cited by 969
The functional data model and the data languages DAPLEX
Shipman, D. W. (1981) · ACM Transactions on Database Systems · doi:10.1145/319540.319561 · Cited by 913
The K-D-B-tree: a search structure for large multidimensional dynamic indexes
Robinson, J. T. (1981) · Proceedings of the 1981 ACM SIGMOD international conference on Management of data - SIGMOD '81 · doi:10.1145/582318.582321 · Cited by 888
A logical design methodology for relational databases using the extended entity-relationship model
Teorey, T. J., Yang, D., & Fry, J. P. (1986) · ACM Computing Surveys · doi:10.1145/7474.7475 · Cited by 752
Logic and Databases: A Deductive Approach
Gallaire, H., Minker, J., & Nicolas, J.-M. (1984) · ACM Computing Surveys · doi:10.1145/356924.356929 · Cited by 733
Proceedings of the International Conference on Very Large Data Bases
Kerr, D. S. (1975) · ACM eBooks · Cited by 701
An amateur's introduction to recursive query processing strategies
Bancilhon, F., & Ramakrishnan, R. (1986) · ACM SIGMOD Record · doi:10.1145/16856.16859 · Cited by 698
The Gamma database machine project
DeWitt, D. J., Ghandeharizadeh, S., Schneider, D. A., Bricker, A., Hsiao, H.-I., & Rasmussen, R. (1990) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.50905 · Cited by 668
A dichromatic framework for balanced trees
Guibas, L. J., & Sedgewick, R. (1978) · 19th Annual Symposium on Foundations of Computer Science (sfcs 1978) · doi:10.1109/sfcs.1978.3 · Cited by 661
Extendible hashing—a fast access method for dynamic files
Fagin, R., Nievergelt, J., Pippenger, N., & Strong, H. R. (1979) · ACM Transactions on Database Systems · doi:10.1145/320083.320092 · Cited by 659
Query Optimization in Database Systems
Jarke, M., & Koch, J. (1984) · ACM Computing Surveys · doi:10.1145/356924.356928 · Cited by 650
Peckham, J., & Maryanski, F. (1988) · ACM Computing Surveys · doi:10.1145/62061.62062 · Cited by 557
Consistency in a partitioned network: a survey
Davidson, S. B., Garcia-Molina, H., & Skeen, D. (1985) · ACM Computing Surveys · doi:10.1145/5505.5508 · Cited by 550
Query processing in a system for distributed databases (SDD-1)
Bernstein, P. A., Goodman, N., Wong, E., Reeve, C. L., & Rothnie, J. B. (1981) · ACM Transactions on Database Systems · doi:10.1145/319628.319650 · Cited by 493
The relational model with relation-valued attributes
Schek, H.-J., & Scholl, M. H. (1986) · Information Systems · doi:10.1016/0306-4379(86)90003-7 · Cited by 474
Implementation of integrity constraints and views by query modification
Stonebraker, M. (1975) · Proceedings of the 1975 ACM SIGMOD international conference on Management of data - SIGMOD '75 · doi:10.1145/500080.500091 · Cited by 465
Toward a unified framework for version modeling in engineering databases
Katz, R. H. (1990) · ACM Computing Surveys · doi:10.1145/98163.98172 · Cited by 429
Vertical partitioning algorithms for database design
Navathe, S., Ceri, S., Wiederhold, G., & Dou, J. (1984) · ACM Transactions on Database Systems · doi:10.1145/1994.2209 · Cited by 420
Join processing in relational databases
Mishra, P., & Eich, M. H. (1992) · ACM Computing Surveys · doi:10.1145/128762.128764 · Cited by 409
The Volcano optimizer generator: extensibility and efficient search
Graefe, G., & McKenna, W. J. (2002) · Proceedings of IEEE 9th International Conference on Data Engineering · doi:10.1109/icde.1993.344061 · Cited by 393
Self-citationDecomposition—a strategy for query processing
Wong, E., & Youssefi, K. (1976) · ACM Transactions on Database Systems · doi:10.1145/320473.320479 · Cited by 387
Operating system support for database management
Stonebraker, M. (1981) · Communications of the ACM · doi:10.1145/358699.358703 · Cited by 382
Lelewer, D. A., & Hirschberg, D. S. (1987) · ACM Computing Surveys · doi:10.1145/45072.45074 · Cited by 377
Types and persistence in database programming languages
Atkinson, M. P., & Buneman, O. P. (1987) · ACM Computing Surveys · doi:10.1145/62070.45066 · Cited by 344
Encapsulation of parallelism in the Volcano query processing system
Graefe, G. (1990) · Proceedings of the 1990 ACM SIGMOD international conference on Management of data · doi:10.1145/93597.98720 · Cited by 340
Self-citationWhy Aren't Operating Systems Getting Faster As Fast as Hardware?
Ousterhout, J. K. (1990) · Cited by 331
A census of Tandem system availability between 1985 and 1990
Gray, J. (1990) · IEEE Transactions on Reliability · doi:10.1109/24.58719 · Cited by 322
Equivalence of Relational Algebra and Relational Calculus Query Languages Having Aggregate Functions
Klug, A. (1982) · Journal of the ACM · doi:10.1145/322326.322332 · Cited by 319
Stonebraker, M. R. (1988) · Cited by 309
Different perspectives on information systems: problems and solutions
Lyytinen, K. (1987) · ACM Computing Surveys · doi:10.1145/28865.28867 · Cited by 287
Extended algebra and calculus for nested relational databases
Roth, M. A., Korth, H. F., & Silberschatz, A. (1988) · ACM Transactions on Database Systems · doi:10.1145/49346.49347 · Cited by 277
A history and evaluation of System R
Chamberlin, D. D., Astrahan, M. M., Blasgen, M. W., Gray, J. N., King, W. F., Lindsay, B. G., Lorie, R., Mehl, J. W., Price, T. G., Putzolu, F., et al. (1981) · Communications of the ACM · doi:10.1145/358769.358784 · Cited by 273
Bell, T., Witten, I. H., & Cleary, J. G. (1989) · ACM Computing Surveys · doi:10.1145/76894.76896 · Cited by 261
The Design of the POSTGRES Storage System
Stonebraker, M. R. (1987) · doi:10.21236/ada187244 · Cited by 255
Implementing a relational database by means of specialzed hardware
Babb, E. (1979) · ACM Transactions on Database Systems · doi:10.1145/320064.320065 · Cited by 254
Introduction to a system for distributed databases (SDD-1)
Rothnie, J. B., Bernstein, P. A., Fox, S., Goodman, N., Hammer, M., Landers, T. A., Reeve, C., Shipman, D. W., & Wong, E. (1980) · ACM Transactions on Database Systems · doi:10.1145/320128.320129 · Cited by 249
Yu, C. T., & Chang, C. C. (1984) · ACM Computing Surveys · doi:10.1145/3872.3874 · Cited by 239
Deadlock detection in distributed databases
Knapp, E. (1987) · ACM Computing Surveys · doi:10.1145/45075.46163 · Cited by 238
Physical database design for relational databases
Finkelstein, S., Schkolnick, M., & Tiberio, P. (1988) · ACM Transactions on Database Systems · doi:10.1145/42201.42205 · Cited by 225
Statistical profile estimation in database systems
Mannino, M. V., Chu, P., & Sager, T. (1988) · ACM Computing Surveys · doi:10.1145/62061.62063 · Cited by 225
System R: Relational Approach to Database Management
ASTRAHAN, M. M., BLASGEN, M. W., CHAMBERLIN, D. D., ESWARAN, K. P., GRAY, J. N., GRIFFITHS, P. P., KING, W. F., LORIE, R. A., McJONES, P. R., MEHL, J. W., et al. (1989) · Readings in Artificial Intelligence and Databases · doi:10.1016/b978-0-934613-53-8.50042-x · Cited by 214
Distributed query processing in a relational data base system
Epstein, R. S., Stonebraker, M. R., & Wong, E. (1978) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/509252.509292 · Cited by 213
Optimizing the performance of a relational algebra database interface
Smith, J. M., & Chang, P. Y.-T. (1975) · Communications of the ACM · doi:10.1145/361020.361025 · Cited by 212
Optimization of parallel query execution plans in XPRS
Hong, W., & Stonebraker, M. R. (1993) · Distributed and Parallel Databases · doi:10.1007/bf01277518 · Cited by 195
Beating the I/O bottleneck: a case for log-structured file systems
Ousterhout, J., & Douglis, F. (1989) · ACM SIGOPS Operating Systems Review · doi:10.1145/65762.65765 · Cited by 185
Duplicate record elimination in large data files
Bitton, D., & DeWitt, D. J. (1983) · ACM Transactions on Database Systems · doi:10.1145/319983.319987 · Cited by 179
Evaluation of relational algebras incorporating the time dimension in databases
McKenzie, L. E., & Snodgrass, R. T. (1991) · ACM Computing Surveys · doi:10.1145/125137.125166 · Cited by 172
A taxonomy of parallel sorting
Bitton, D., DeWitt, D. J., Hsaio, D. K., & Menon, J. (1984) · ACM Computing Surveys · doi:10.1145/2514.2516 · Cited by 169
Optimal semijoins for distributed database systems
Mullin, J. K. (1990) · IEEE Transactions on Software Engineering · doi:10.1109/32.52778 · Cited by 158
Schlack, M. (1993) · Datamation · Cited by 153
Transactions and consistency in distributed database systems
Traiger, I. L., Gray, J., Galtieri, C. A., & Lindsay, B. G. (1982) · ACM Transactions on Database Systems · doi:10.1145/319732.319734 · Cited by 151
Computing queries from derived relations
Larson, P.-Å., & Yang, H. Z. (1985) · Very Large Data Bases · Cited by 149
Buffer management in relational database systems
Sacco, G. M., & Schkolnick, M. (1986) · ACM Transactions on Database Systems · doi:10.1145/7239.7336 · Cited by 143
Database Support for Versions and Alternatives of Large Design Files
Katz, R. H., & Lehman, T. J. (1984) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1984.5010222 · Cited by 138
Gray, J., & Putzolu, F. (1987) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/38713.38755 · Cited by 137
Query Transformation for PSJ-Queries
Yang, H. Z., & Larson, P.-Å. (1987) · Very Large Data Bases · Cited by 136
Cactis: a self-adaptive, concurrent implementation of an object-oriented database management system
Hudson, S. E., & King, R. (1989) · ACM Transactions on Database Systems · doi:10.1145/68012.68013 · Cited by 133
Operating system support for database management
Stonebraker, M. R. (1986) · Addison-Wesley Longman Publishing Co., Inc. eBooks · Cited by 132
On Concurrency Control by Multiple Versions
Papadimitriou, C. H., & Kanellakis, P. C. (1984) · ACM Transactions on Database Systems · doi:10.1145/348.318588 · Cited by 120
Index selection in a self-adaptive data base management system
Hammer, M. M., & Chan, A. (1976) · Proceedings - ACM-SIGMOD International Conference on Management of Data · doi:10.1145/509383.509385 · Cited by 118
An analysis of geometric modeling in database systems
Kemper, A., & Wallrath, M. (1987) · ACM Computing Surveys · doi:10.1145/28865.28866 · Cited by 103
Data compression on a database system
Cormack, G. V. (1985) · Communications of the ACM · doi:10.1145/214956.214963 · Cited by 84
On mixing queries and transactions via multiversion locking
Bober, P. M., & Carey, M. J. (2003) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde.1992.213155 · Cited by 78
A framework for choosing a database query language
Jarke, M., & Vassiliou, Y. (1985) · ACM Computing Surveys · doi:10.1145/5505.5506 · Cited by 77
Implementation concepts for an extensible data model and data language
Batory, D. S., Leung, T. Y. C., & Wise, T. E. (1988) · ACM Transactions on Database Systems · doi:10.1145/44498.45062 · Cited by 77
Database Reorganization—Principles and Practice
Sockut, G. H., & Goldberg, R. P. (1979) · ACM Computing Surveys · doi:10.1145/356789.356796 · Cited by 76
On recursive axioms in deductive databases
Minker, J., & Nicolas, J.-M. (1983) · Information Systems · doi:10.1016/0306-4379(83)90024-8 · Cited by 71
Implementing a generalized access path structure for a relational database system
Haerder, T. (1978) · ACM Transactions on Database Systems · doi:10.1145/320263.320284 · Cited by 62
Anatomy of a Mudular Multiple Query Optimizer
Rosenthal, A. S., & Chakravarthy, U. S. (1988) · Very Large Data Bases · Cited by 59
Failure correction techniques for large disk arrays
Gibson, G. A., Hellerstein, L., Karp, R. M., et al. (1989) · ACM SIGARCH Computer Architecture News · doi:10.1145/68182.68194 · Cited by 56
Statistical estimators for aggregate relational algebra queries
Hou, W., & Özsoyoğlu, G. (1991) · ACM Transactions on Database Systems · doi:10.1145/115302.115300 · Cited by 55
An optimal evaluation of Boolean expressions in an online query system
Hanani, M. Z. (1977) · Communications of the ACM · doi:10.1145/359581.359600 · Cited by 53
Separability —An Approach to Physical Database Design
Whang, K.-Y., Wiederhold, & Sagalowicz (1984) · IEEE Transactions on Computers · doi:10.1109/tc.1984.1676418 · Cited by 51
A practitioner's guide to data base compression tutorial
Severance, D. G. (1983) · Information Systems · doi:10.1016/0306-4379(83)90030-3 · Cited by 42
On the translation of relational queries into iterative programs
Freytag, J. C., & Goodman, N. (1989) · ACM Transactions on Database Systems · doi:10.1145/62032.62033 · Cited by 32
An association algebra for processing object-oriented databases
Guo, M., Su, S. Y. W., & Lam, H. X. (2002) · Proceedings - International Conference on Data Engineering · doi:10.1109/icde.1991.131449 · Cited by 30
A Dual Space Representation for Geometric Data
Günther, O., & Wong, E. (1987) · Cited by 10
Cited by
Data Cube: A Relational Aggregation Operator Generalizing Group-By, Cross-Tab, and Sub-Totals
Gray, J., Chaudhuri, S., Bosworth, A., Layman, A., Reichart, D., Venkatrao, M., Pellow, F., & Pirahesh, H. (1997) · Data Mining and Knowledge Discovery · doi:10.1023/a:1009726021843 · Cited by 2,134
The Lorel query language for semistructured data
Abiteboul, S., Quass, D., McHugh, J., Widom, J., & Wiener, J. L. (1997) · International Journal on Digital Libraries · doi:10.1007/s007990050005 · Cited by 1,058
The state of the art in distributed query processing
Kossmann, D. (2000) · ACM Computing Surveys · doi:10.1145/371578.371598 · Cited by 813
An overview of business intelligence technology
Chaudhuri, S., Dayal, U., & Narasayya, V. (2011) · Communications of the ACM · doi:10.1145/1978542.1978562 · Cited by 760
The RDF-3X engine for scalable management of RDF data
Neumann, T., & Weikum, G. (2010) · The VLDB Journal · doi:10.1007/s00778-009-0165-y · Cited by 635
Metadata
- Authors
- Graefe, G.
- Venue
- ACM Computing Surveys
- Published
- 1993-06
- Volume
- 25
- Issue
- 2
- Pages
- 73-169
- ISSN
- 0360-0300 (ISSN-L)
- 1557-7341
- OpenAlex
- W2158237121
- Cited by
- 1,262
- References
- 106
- FWCI
- 40.40
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.