The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
Relational database: a practical foundation for productivity
Open accessAbstract
by President Peter" Denr~ing on November 9, 1981 at the ACM Annual Conference in Los Angeles, California.~t is the Association's foremost award fbr technical contributions to the computing community.Codd was selected by the ACM General Technical Achievement Award Committee for his "fundamental and continuing contributions to the theory and practice of database management systems."The originator of the relational model for databases, Codd has made t~rther important contributions in the development of relational algebra, relational calculus, and normalization of relations.Edgar F. Codd joined IBM in 1949 to prepare programs for the Selective Sequence Electronic Calculator.Since then, his work in computing has encompassed ~ogicat design of computers (IBM 701 and Stretch), managing a computer center in Canada, heading the development of one of the first operating systems with a general muitiprogramming capability, contributing to the logic of selt: reproducing automata, developing high level techniques for software specification, creating and extending the relational approach to database management, and developing an English analyzing and synthesizing subsystem for casual users of relational databases.He is also the author of Cellular Automata, an early volume in the ACM Monograph Series.
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. (1970) · Communications of the ACM · doi:10.1145/362384.362685 · Cited by 5,547
Self-citationA 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
Self-citationAccess 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
Extending the database relational model to capture more meaning
Codd, E. F. (1979) · ACM Transactions on Database Systems · doi:10.1145/320107.320109 · Cited by 1,559
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
The transaction concept: virtues and limitations
Gray, J. (1988) · Cited by 602
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
Zloof, M. M. (1975) · AFIPS National Computer Conference (NCC) · doi:10.1145/1499949.1500034 · Cited by 491
An authorization mechanism for a relational database system
Griffiths, P. P., & Wade, B. W. (1976) · ACM Transactions on Database Systems · doi:10.1145/320473.320482 · Cited by 402
Horn clauses and database dependencies
Fagin, R. (1982) · Journal of the ACM · doi:10.1145/322344.322347 · Cited by 380
Some high level language constructs for data of type relation
Schmidt, J. W. (1977) · ACM Transactions on Database Systems · doi:10.1145/320557.320568 · Cited by 338
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
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
Beeri, C., Bernstein, P. A., & Goodman, N. (1989) · Readings in Artificial Intelligence and Databases · doi:10.1016/b978-0-934613-53-8.50035-2 · Cited by 215
Human Factors Studies of Database Query Languages: A Survey and Assessment
Reisner, P. (1981) · ACM Computing Surveys · doi:10.1145/356835.356837 · Cited by 210
Functional specifications of a subsystem for data base integrity
Eswaran, K. P., & Chamberlin, D. D. (1975) · Proceedings of the 1st International Conference on Very Large Data Bases - VLDB '75 · doi:10.1145/1282480.1282484 · Cited by 174
A Formal Approach to Null Values in Database Relations
Biskup, J. (1981) · Springer eBooks · doi:10.1007/978-1-4615-8297-7_11 · Cited by 105
Theory of relations for databases — a tutorial survey
Rissanen, J. (1978) · Lecture notes in computer science · doi:10.1007/3-540-08921-7_102 · Cited by 95
Cited by
Pipino, L. L., Lee, Y. W., & Wang, R. Y. (2002) · Communications of the ACM · doi:10.1145/505248.506010 · Cited by 1,724
The Anatomy of a Design Theory
Central Queensland University, A., Jones, D., Gregor, S., & The Australian National University, A. (2007) · Journal of the Association for Information Systems · doi:10.17705/1jais.00129 · Cited by 1,490
Principles of transaction-oriented database recovery
Haerder, T., & Reuter, A. (1983) · ACM Computing Surveys · doi:10.1145/289.291 · Cited by 1,217
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
A framework for analysis of data quality research
Wang, R. Y., Storey, V. C., & Firth, C. P. (1995) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.404034 · Cited by 685
Metadata
- Authors
- Codd, E. F.
- Venue
- Communications of the ACM
- Published
- 1982-02
- Volume
- 25
- Issue
- 2
- Pages
- 109-117
- ISSN
- 0001-0782 (ISSN-L)
- 1557-7317
- OpenAlex
- W2050465692
- Cited by
- 351
- References
- 18
- FWCI
- 36.74
- 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.