The DOI matches its Crossref record; 53 of the 53 references it cites were found in a registry or an index.
Types and persistence in database programming languages
Abstract
Traditionally, the interface between a programming language and a database has either been through a set of relatively low-level subroutine calls, or it has required some form of embedding of one language in another. Recently, the necessity of integrating database and programming language techniques has received some long-overdue recognition. In response, a number of attempts have been made to construct programming languages with completely integrated database management systems. These languages, which we term database programming languages , are the subject of this review. The design of these languages is still in its infancy, and the purpose of writing this review is to identify the areas in which further research is required. In particular, we focus on the problems of providing a uniform type system and mechanisms for data to persist. Of particular importance in solving these problems are issues of polymorphism, type inheritance, object identity, and the choice of structures to represent sets of similar values. Our conclusion is that there are areas of programming language research—modules, polymorphism, persistence, and inheritance—that must be developed and applied to achieve the goal of a useful and consistent database programming language. Other research areas of equal importance, such as implementation, transaction handling, and concurrency, are not examined here in any detail.
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 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
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
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
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
Smalltalk-80: The Language and its Implementation
Goldberg, A., & Robson, D. J. (1983) · HAL · Cited by 3,866
Introduction to Database Systems
(2006) · Foundations of Database Design · doi:10.1201/9781420003345.ch1 · Cited by 3,521
Backus, J. (1978) · Communications of the ACM · doi:10.1145/359576.359579 · Cited by 2,609
A theory of type polymorphism in programming
Milner, R. (1978) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(78)90014-4 · Cited by 2,205
Clocksin, W. F., & Mellish, C. (1984) · Springer eBooks · doi:10.1007/978-3-642-55481-0 · Cited by 2,047
On understanding types, data abstraction, and polymorphism
Cardelli, L., & Wegner, P. (1985) · ACM Computing Surveys · doi:10.1145/6041.6042 · Cited by 1,669
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
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
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 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
SIMULA: an ALGOL-based simulation language
Dahl, O.-J., & Nygaard, K. (1966) · Communications of the ACM · doi:10.1145/365813.365819 · Cited by 855
Database description with SDM: a semantic database model
Hammer, M., & Mc Leod, D. (1981) · ACM Transactions on Database Systems · doi:10.1145/319587.319588 · Cited by 753
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
The programming language pascal
Wirth, N. (1971) · Acta Informatica · doi:10.1007/bf00264291 · Cited by 716
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
Stonebraker, M., & Rowe, L. A. (1986) · ACM SIGMOD Record · doi:10.1145/16856.16888 · Cited by 696
Query Optimization in Database Systems
Jarke, M., & Koch, J. (1984) · ACM Computing Surveys · doi:10.1145/356924.356928 · Cited by 650
Miranda: A non-strict functional language with polymorphic types
Turner, D. A. (1985) · Lecture notes in computer science · doi:10.1007/3-540-15975-4_26 · Cited by 631
What IS-A Is and Isn't: An Analysis of Taxonomic Links in Semantic Networks
Brachman (1983) · Computer · doi:10.1109/mc.1983.1654194 · Cited by 571
Gallaire, H., & Minker, J. (1978) · Medical Entomology and Zoology · Cited by 559
McCarthy, J., Abrahams, P. W., Edwards, D. J., Hart, T. P., & Levin, M. I. (1962) · doi:10.21236/ad0406138 · Cited by 555
“Memo” Functions and Machine Learning
MICHIE, D. (1968) · Nature · doi:10.1038/218019a0 · Cited by 551
A language facility for designing database-intensive applications
Mylopoulos, J., Bernstein, P. A., & Wong, H. K. T. (1980) · ACM Transactions on Database Systems · doi:10.1145/320141.320150 · Cited by 485
Khoshafian, S. N., & Copeland, G. P. (1986) · ACM SIGPLAN Notices · doi:10.1145/960112.28739 · Cited by 472
Rationale for the design of the Ada programming language
Ichbiah, J. D., Krieg-Brueckner, B., Wichmann, B. A., Barnes, J. G. P., Roubine, O., & Heliard, J.-C. (1979) · ACM SIGPLAN Notices · doi:10.1145/956653.956654 · Cited by 403
Development of an object-oriented DBMS
Maier, D., Stein, J., Otis, A., & Purdy, A. (1986) · ACM SIGPLAN Notices · doi:10.1145/960112.28746 · Cited by 390
Report on the programming language Euclid
Lampson, B., Horning, J. J., London, R. L., Mitchell, J. G., & Popek, G. J. (1977) · ACM SIGPLAN Notices · doi:10.1145/954666.971189 · Cited by 385
Making smalltalk a database system
Copeland, G. P., & Maier, D. (1984) · Proceedings - ACM-SIGMOD International Conference on Management of Data · doi:10.1145/602259.602300 · Cited by 366
A semantics of multiple inheritance
Cardelli, L. (1984) · Lecture notes in computer science · doi:10.1007/3-540-13346-1_2 · Cited by 359
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
Henderson, P., & Morris, J. H. (1976) · Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages - POPL '76 · doi:10.1145/800168.811543 · Cited by 325
(2012) · Using LEDs, LCDs and GLCDs in Microcontroller Projects · doi:10.1002/9781118361054.ch3 · Cited by 307
(1981) · Lecture Notes in Computer Science · doi:10.1007/bfb0035014 · Cited by 296
MacQueen, D. (1984) · Proceedings of the 1984 ACM Symposium on LISP and functional programming - LFP '84 · doi:10.1145/800055.802036 · Cited by 269
A generalization of Dijkstra's algorithm
Knuth, D. E. (1977) · Information Processing Letters · doi:10.1016/0020-0190(77)90002-3 · Cited by 263
Milner, R. (1984) · doi:10.1145/800055.802035 · Cited by 253
Language features for flexible handling of exceptions in information systems
Borgida, A. (1985) · ACM Transactions on Database Systems · doi:10.1145/4879.4995 · Cited by 231
EQLOG: Equality, Types, and Generic Modules For Logic Programming.
Goguen, J. A., & José Meseguer, B. (1986) · Cited by 214
The management of changing types in an object-oriented database
Skarra, A. H., & Zdonik, S. B. (1986) · ACM SIGPLAN Notices · doi:10.1145/960112.28747 · Cited by 208
Limitations of record-based information models
Kent, W. (1979) · ACM Transactions on Database Systems · doi:10.1145/320064.320070 · Cited by 207
Kent, W. (1978) · Cited by 203
PS-algol: an algol with a persistent heap
Atkinson, M., Chisholm, K., & Cockshott, P. (1982) · ACM SIGPLAN Notices · doi:10.1145/988376.988378 · Cited by 160
Self-citationEquality, types, modules, and (why not?) generics for logic programming
Goguen, J. A., & Meseguer, J. (1984) · The Journal of Logic Programming · doi:10.1016/0743-1066(84)90004-9 · Cited by 155
A framework for choosing a database query language
Jarke, M., & Vassiliou, Y. (1985) · ACM Computing Surveys · doi:10.1145/5505.5506 · Cited by 77
Inheritance and persistence in database programming languages
Buneman, P., & Atkinson, M. (1986) · ACM SIGMOD Record · doi:10.1145/16856.16858 · Cited by 37
Self-citationTheseus—a programming language for relational databeses
Shopiro, J. E. (1979) · ACM Transactions on Database Systems · doi:10.1145/320107.320121 · Cited by 35
Jarke, M., & Koch, J. (1983) · Proceedings - ACM-SIGMOD International Conference on Management of Data · doi:10.1145/582192.582225 · Cited by 27
The architecture of the PLAIN data base handler
Kersten, M. L., Wasserman, A. I., & Wasserman, A. I. (1981) · Software Practice and Experience · doi:10.1002/spe.4380110208 · Cited by 17
Cited by
Query evaluation techniques for large databases
Graefe, G. (1993) · ACM Computing Surveys · doi:10.1145/152610.152611 · Cited by 1,262
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
Object identity as a query language primitive
Abiteboul, S., & Kanellakis, P. C. (1989) · ACM SIGMOD Record · doi:10.1145/66926.66941 · Cited by 362
A Literature Review on Schema Evolution in Databases
Brahmia, Z., Grandi, F., & Oliboni, B. (2024) · Computing Open · doi:10.1142/s2972370124300012 · Cited by 12
Metadata
- Authors
- Atkinson, M. P., & Buneman, O. P.
- Venue
- ACM Computing Surveys
- Published
- 1987-06
- Volume
- 19
- Issue
- 2
- Pages
- 105-170
- ISSN
- 0360-0300 (ISSN-L)
- 1557-7341
- OpenAlex
- W2005318605
- Cited by
- 344
- References
- 53
- FWCI
- 40.91
- Type
- journal article
- 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.