The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Access path selection in a relational database management system
Abstract
In a high level query and data manipulation language such as SQL, requests are stated non-procedurally, without reference to access paths. This paper describes how System R chooses access paths for both simple (single relation) and complex queries (such as joins), given a user specification of desired data as a boolean expression of predicates. System R is an experimental database management system developed to carry out research on the relational model of data. System R was designed and built by members of the IBM San Jose Research Laboratory.
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
A relational model of data for large shared data banks
Codd, E. F. (1983) · Communications of the ACM · doi:10.1145/357980.358007 · Cited by 4,796
Introduction to Database Systems
(2006) · Foundations of Database Design · doi:10.1201/9781420003345.ch1 · Cited by 3,521
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
Self-citationThe design and implementation of INGRES
Stonebraker, M., Held, G., Wong, E., & Kreps, P. (1976) · ACM Transactions on Database Systems · doi:10.1145/320473.320476 · Cited by 886
SEQUEL 2: A Unified Approach to Data Definition, Manipulation, and Control
Chamberlin, D. D., Astrahan, M. M., Eswaran, K. P., Griffiths, P. P., Lorie, R. A., Mehl, J. W., Reisner, P., & Wade, B. W. (1976) · IBM Journal of Research and Development · doi:10.1147/rd.206.0560 · Cited by 523
Self-citationZloof, M. M. (1975) · AFIPS National Computer Conference (NCC) · doi:10.1145/1499949.1500034 · Cited by 491
Decomposition—a strategy for query processing
Wong, E., & Youssefi, K. (1976) · ACM Transactions on Database Systems · doi:10.1145/320473.320479 · Cited by 387
System R: A Relational Data Base Management System
Astrahan, Blasgen, Chamberlin, et al. (1979) · Computer · doi:10.1109/mc.1979.1658743 · Cited by 47
Cited by
Answering queries using views: A survey
Halevy, A. Y. (2001) · The VLDB Journal · doi:10.1007/s007780100054 · Cited by 1,510
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
Probabilistic counting algorithms for data base applications
Flajolet, P., & Nigel Martin, G. (1985) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(85)90041-8 · Cited by 1,269
Query evaluation techniques for large databases
Graefe, G. (1993) · ACM Computing Surveys · doi:10.1145/152610.152611 · Cited by 1,262
The state of the art in distributed query processing
Kossmann, D. (2000) · ACM Computing Surveys · doi:10.1145/371578.371598 · Cited by 813
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
Stonebraker, M., & Rowe, L. A. (1986) · ACM SIGMOD Record · doi:10.1145/16856.16888 · Cited by 696
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
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
Continuously adaptive continuous queries over streams
Madden, S., Shah, M., Hellerstein, J. M., & Raman, V. (2002) · Proceedings of the 2002 ACM SIGMOD international conference on Management of data · doi:10.1145/564691.564698 · Cited by 583
RDF-3X: a RISC-style engine for RDF
Neumann, T., & Weikum, G. (2008) · Proceedings of the VLDB Endowment · doi:10.14778/1453856.1453927 · Cited by 562
Improved histograms for selectivity estimation of range predicates
Poosala, V., Haas, P. J., Ioannidis, Y. E., & Shekita, E. J. (1996) · Proceedings of the 1996 ACM SIGMOD international conference on Management of data - SIGMOD '96 · doi:10.1145/233269.233342 · Cited by 556
Cypher: An Evolving Query Language for Property Graphs
Francis, N., Green, A., Guagliardo, P., Libkin, L., Lindaaker, T., Marsault, V., Plantikow, S., Rydberg, M., Selmer, P., & Taylor, A. (2018) · Proceedings of the 2018 International Conference on Management of Data · doi:10.1145/3183713.3190657 · Cited by 545
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 Stratosphere platform for big data analytics
Alexandrov, A., Bergmann, R., Ewen, S., Freytag, J.-C., Hueske, F., Heise, A., Kao, O., Leich, M., Leser, U., Markl, V., et al. (2014) · The VLDB Journal · doi:10.1007/s00778-014-0357-y · Cited by 432
Henzinger, M., Raghavan, P., & Rajagopalan, S. (1999) · DIMACS Series in Discrete Mathematics and Theoretical Computer Science · doi:10.1090/dimacs/050/05 · Cited by 418
Join processing in relational databases
Mishra, P., & Eich, M. H. (1992) · ACM Computing Surveys · doi:10.1145/128762.128764 · Cited by 409
Efficient and extensible algorithms for multi query optimization
Roy, P., Seshadri, S., Sudarshan, S., & Bhobe, S. (2000) · ACM SIGMOD Record · doi:10.1145/335191.335419 · Cited by 403
On optimizing an SQL-like nested query
Kim, W. (1982) · ACM Transactions on Database Systems · doi:10.1145/319732.319745 · Cited by 393
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
Neo: a learned query optimizer
Marcus, R., Negi, P., Mao, H., Zhang, C., Alizadeh, M., Kraska, T., Papaemmanouil, O., & Tatbul, N. (2019) · Proceedings of the VLDB Endowment · doi:10.14778/3342263.3342644 · Cited by 389
Supporting top-k join queries in relational databases
Ilyas, I., Aref, W., & Elmagarmid, A. (2004) · The VLDB Journal · doi:10.1007/s00778-004-0128-2 · Cited by 385
Optimizing queries with materialized views
Chaudhuri, S., Krishnamurthy, R., Potamianos, S., & Shim, K. (2002) · Proceedings of the Eleventh International Conference on Data Engineering · doi:10.1109/icde.1995.380392 · Cited by 374
NoScope: optimizing neural network queries over video at scale
Kang, D., Emmons, J., Abuzaid, F., Bailis, P., & Zaharia, M. (2017) · Proceedings of the VLDB Endowment · doi:10.14778/3137628.3137664 · Cited by 367
“In this way, NOSCOPE acts as a system for model search [14, 23, 102] for efficient inference and is inspired by conventional database cost optimization [83] and related efforts on self-adapting query processing engines [20, 47].”
MethodQuery reformulation for dynamic information integration
Arens, Y., Knoblock, C. A., & Shen, W.-M. (1996) · Journal of Intelligent Information Systems · doi:10.1007/bf00122124 · Cited by 364
Relational database: a practical foundation for productivity
Codd, E. F. (1982) · Communications of the ACM · doi:10.1145/358396.358400 · Cited by 351
Object-oriented databases: definition and research directions
Kim, W. (1990) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.60796 · Cited by 326
Worst-case optimal join algorithms: [extended abstract]
Ngo, H. Q., Porat, E., Ré, C., & Rudra, A. (2012) · Proceedings of the 31st ACM SIGMOD-SIGACT-SIGAI symposium on Principles of Database Systems · doi:10.1145/2213556.2213565 · Cited by 324
Implementing declarative overlays
Loo, B. T., Condie, T., Hellerstein, J. M., Maniatis, P., Roscoe, T., & Stoica, I. (2005) · ACM SIGOPS Operating Systems Review · doi:10.1145/1095809.1095818 · Cited by 292
Towards automatic optimization of MapReduce programs
Babu, S. (2010) · Proceedings of the 1st ACM symposium on Cloud computing · doi:10.1145/1807128.1807150 · Cited by 283
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
Self-citationDuggan, J., Elmore, A. J., Stonebraker, M., Balazinska, M., Howe, B., Kepner, J., Madden, S., Maier, D., Mattson, T., & Zdonik, S. (2015) · ACM SIGMOD Record · doi:10.1145/2814710.2814713 · Cited by 269
Approximate medians and other quantiles in one pass and with limited memory
Manku, G. S., Rajagopalan, S., & Lindsay, B. G. (1998) · Proceedings of the 1998 ACM SIGMOD international conference on Management of data · doi:10.1145/276304.276342 · Cited by 261
Nephele/PACTs: a programming model and execution framework for web-scale analytical processing
Battré, D., Ewen, S., Hueske, F., Kao, O., Markl, V., & Warneke, D. (2010) · Proceedings of the 1st ACM symposium on Cloud computing · doi:10.1145/1807128.1807148 · Cited by 261
Elements of Relational Database Theory
KANELLAKIS, P. C. (1990) · Formal Models and Semantics · doi:10.1016/b978-0-444-88074-1.50022-6 · Cited by 259
CodexDB: synthesizing code for query processing from natural language instructions using GPT-3 codex
Trummer, I. (2022) · Proceedings of the VLDB Endowment · doi:10.14778/3551793.3551841 · Cited by 65
Reducing Order Enforcement Cost in Complex Query Plans
Guravannavar, R., Sudarshan, S., Diwan, A. A., & Babu, C. S. (2006) · arXiv · doi:10.48550/arxiv.cs/0611094 · Cited by 9
Metadata
- Authors
- Selinger, P. G., Astrahan, M. M., Chamberlin, D. D., Lorie, R. A., & Price, T. G.
- Venue
- Proceedings of the 1979 ACM SIGMOD international conference on Management of data - SIGMOD '79
- Publisher
- ACM Press
- Published
- 1979
- Pages
- 23
- ISSN
- 0730-8078 (ISSN-L)
- OpenAlex
- W2153329411
- Cited by
- 2,188
- References
- 8
- Type
- conference abstract
- Language
- en
- Open access
- closed
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.