Relational Data-Base Management Systems
ACM Computing SurveysPublished 1 March 1976Open access
Donald D. Chamberlin
Citations145
SJR quartileQ1
SJR score5.80
SNIP11.03
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
Abstract
article Free Access Share on Relational Data-Base Management Systems Author: Donald D. Chamberlin IBM Research Laboratory, San Jose, California IBM Research Laboratory, San Jose, CaliforniaView Profile Authors Info & Claims ACM Computing SurveysVolume 8Issue 1March 1976 pp 43–66https://doi.org/10.1145/356662.356665Online:01 March 1976Publication History 122citation2,329DownloadsMetricsTotal Citations122Total Downloads2,329Last 12 Months166Last 6 weeks32 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
Keywords
Computer Science
Communications of the ACMA relational model of data for large shared data banks
4,834 Citations1983E. F. Codd
Foundations of database design/Foundations of database design seriesIntroduction to Database Systems
3,542 Citations2006
Readers of this book will gain a strong working knowledge of the overall structure, concepts, and objectives of database systems and will become familiar with the theoretical principles underlying the construction of such systems.
Elsevier eBooksSymbolic Logic and Mechanical Theorem Proving
1,472 Citations1973
This book contains an introduction to symbolic logic and a thorough discussion of mechanical theorem proving its applications and how it can be applied to various areas such as question answering, problem solving, program analysis, and program synthesis.
Acta InformaticaOrganization and maintenance of large ordered indexes
1,345 Citations1972Raymond Bayer, Edward M. McCreight
The index organization described allows retrieval, insertion, and deletion of keys in time proportional to logkI where I is the size of the index and k is a device dependent natural number such that the performance of the scheme becomes near optimal.
SEQUEL
576 Citations1976Donald D. Chamberlin, Raymond F. Boyce
The data manipulation facility for a structured English query language (SEQUEL) which can be used for accessing data in an integrated relational data base.
DSpace@MIT (Massachusetts Institute of Technology)Procedures as a representation for data in a computer program for understanding natural language
520 Citations1971Terry Winograd
A system for the computer understanding of English that combines a complete syntactic analysis of each sentence with a 'heuristic understander' which uses different kinds of information about a sentence, other parts of the discourse, and general information about the world in deciding what the sentence means.
Query by example
489 Citations1975Moshé M. Zloof
In the last few years the authors have witnessed a trend to appeal to the non-professional user who has little or virtually no computer or mathematical background, and this book aims to address that need.
Implementation of integrity constraints and views by query modification
435 Citations1975Michael Stonebraker
The mechanism being implemented in one relational system to prevent integrity violations which can result from improper updates by a process is indicated.
A data base sublanguage founded on the relational calculus
372 Citations1971E. F. Codd
Three principal types of language for data base manipulation are identified: the low-level, procedure-oriented, intermediate level, algebraic, and the high level, relational calculus-based data sublanguage, an example of which is described in this paper.
Query-by-example
238 Citations1975Moshé M. Zloof
It is shown how one can make preliminary interrogations to retrieve a subset of the data base needed for the formulation of a specific query, which becomes very useful in cases where the data-base is very large and the user's initial task of scanning the tables for the ones relevant to his specific query becomes by itself horrendous.
ACM SIGMIS Database the DATABASE for Advances in Information SystemsData structure diagrams
199 Citations1969Charles W. Bachman
The invention of algebra, essentially a graphic technique for communicating truths with respect to classes of arithmetic statements, broke the bond that slowed the development of mathematics.
RAP
179 Citations1975Esen A. Ozkarahan, S. A. Schuster +1 more
Pointer mechanisms for mapping structures and providing fast access paths have to be implemented by software and data for efficient search mechanisms to handle large data bases within concurrent processing and on-line response limits.
Normalized data base structure
172 Citations1971E. F. Codd
This paper illustrates the removal of repeating groups, hierarchic and plex structures, and cross-referencing structures and the simplification of data base relations by normalization is discussed.
IBM Systems JournalData structures and accessing in data-base systems, I: Evolution of information systems
171 Citations1973Michael E. Senko, Eitan Altman +2 more
In this paper, aspects of information systems that are of importance to systems analysts, systems designers, and implementors are emphasized.
Communications of the ACMImplementation of a structured English query language
154 Citations1975M. M. Astrahan, Donald D. Chamberlin
The relational model of data, the XRM Relational Memory System, and the SEQUEL language, a relational data sublanguage intended for ad hoc interactive problem solving by non-computer specialists, are reviewed.
Data base task group report to the CODASYL programming language committee, April 1971
153 Citations1971A. Metaxides, William Helgeson +20 more
Communications of the ACMAn ALGOL-based associative language
150 Citations1969Jerome A. Feldman, Paul Rovner
A high level programming language for large, complex associative structures has been designed and implemented using a hash-coding technique and the discussion includes a comparison with other work and examples of applications.
Communications of the ACMNatural language question-answering systems: 1969
148 Citations1970Robert F. Simmons
It is concluded that at least mini-malty effective techniques have been devised for answering questions from natural language subsets in small scale experimental systems and that a useful paradigm has evolved to guide research efforts in the field.
Communications of the ACMThe programmer as navigator
148 Citations1973Charles W. Bachman
This year the whole world celebrates the five-hundredth birthday of Nicolaus Copernicus, the famous Polish astronomer and mathematician, whose book Concerning the Revolutions of Celestial Spheres described a new theory about the relative physical movements of the earth, the planets, and the sun.
On the semantics of the relational data model
144 Citations1975Hans Albrecht Schmid, J. R. Swenson
A data model is discussed that takes into account basic semantic properties that object types and relationships among them apparently have in the real world, and permits us to analyze the ideas behind the relational theory more precisely, in particular the meaning of functional dependency and normalization.
Access control in a relational data base management system by query modification
136 Citations1974Michael Stonebraker, Eugene Wong
The basic idea utilized is that a user interaction with the data base is modified to an alternate form which is guaranteed to have no access violations, and this modification takes place in a high level interaction language.
IBM Journal of Research and DevelopmentDecomposition of a Data Base and the Theory of Boolean Switching Functions
127 Citations1973Claude Delobel, R. G. Casey
An important equivalence between operations with functional relations and operations with analogous Boolean functions is demonstrated and is computationally helpful in exploring the properties of a given set of functional relations, as well as in the task of partitioning a data set into subfiles for efficient implementation.
Communications of the ACMA back-end computer for data base management
117 Citations1974R. H. Canaday, Robert D. Harrison +3 more
An experimental implementation of the eXperimental Data Management System, XDMS, is described and certain conclusions about the back-end approach are drawn from this implementation.
ACM Computing SurveysElements of Data Management Systems
103 Citations1969George G. Dodd
A description of the basic types of data management techniques, as well as the relation of each to the hardware on which it is used, and how these basic elements can be used as building blocks to describe and build more complex data management systems.
Human factors evaluation of two data base query languages
101 Citations1975Phyllis Reisner, Raymond F. Boyce +1 more
Two data base query languages, SQUARE and SEQUEL, which are intended for use in an interactive mode by both programmers and professional non-programmers (e.g., accountants, lawyers, managers).
Communications of the ACMSpecifying queries as relational expressions
100 Citations1975Raymond F. Boyce, Donald D. Chamberlin +2 more
A data sublanguage called SQUARE, intended for use in ad hoc, interactive problem solving by non-computer specialists, and is shown to be relationally complete; however, it avoids the quantifiers and bound variables required by languages based on the relational calculus.
The relational and network approaches
72 Citations1975C. J. Date, E. F. Codd
The purpose of this paper is to give some comparisons between these two approaches (primarily from the application programming viewpoint), and to show what the authors believe to be the advantages of the relational approach.
Communications of the ACMMatrix computations with Fortran and paging
66 Citations1972C Moler
The efficiency of conventional Fortran programs for matrix computations can be improved by reversing the order of nested loops, and such modifications produce modest savings in many common situations.
Information SystemsA Data Base Search Problem
63 Citations1974F. P. Palermo
The problem of constructing an efficient retrieval algorithm for responding to queries of arbitrary complexity on a relational data base by translating a relation-defining expression in the relational calculus into a retrieval algorithm.
Communications of the ACMA computer system for inference execution and data retrieval
62 Citations1967Roger E. Levien, M. E. Maron
This paper presents a RAND project concerned with the use of computers as assistants in the logical analysis of large collections of factual data and a system called the Relational Data File was developed.
REL
61 Citations1969Frederick B. Thompson, Peter C. Lockemann +2 more
Within this framework, it has been sought to provide languages which are natural for typical users, and one such application language, REL English, is outlined.
Computing joins of relations
60 Citations1975Leo R. Gotlieb
How one relational operation, the join, can be efficiently computed is examined, and algorithms are presented, and evaluated with respect to storage use and computing time.
A general purpose programming system for random access memories
50 Citations1964Charles W. Bachman, S. B. Williams
During the past ten years, information processing technology has made significant advances in many directions and applications now include the complete spectrum ranging from free-standing analytical programs to large complex information processing systems.
Communications of the ACMA practitioner's guide to addressing algorithms
48 Citations1976Dennis G. Severance, Ricardo Duhne
This paper consolidates a number of popular rules of thumb which have been suggested for the design of record addressing algorithms, and discusses the applicability of these rules to large commercial databases.
Interactive support for non-programmers
48 Citations1975E. F. Codd, C. J. Date
A relational discipline is suggested as a way out for DBTG users and it is not at all clear how the network approach can reach this goal, so long as the principal schema includes owner-coupled sets “bearing information essentially”.
A unified approach to functional dependencies and relations
46 Citations1975P.A. Bernstein, J. R. Swenson +1 more
How the use of functional dependencies lends itself to a rigorous and correct, yet clear and simple description of complex data relationships is discussed, and some new computational techniques to map functional dependencies into normal form relations algorithmically are outlined, allowing the dependencies as a basic unit on the implementation as well as conceptual level.
Very Large Data BasesGranularity of Locks in a Large Shared Data Base.
46 Citations1975Jim Gray, Raymond A. Lorie +2 more
Communications of the ACMA preliminary system for the design of DBTG data structures
43 Citations1975Rob Gerritsen
An operational computer program is described which utilizes the functional approach to design data structures conforming to the Data Base Task Group specifications.
Automatic data base schema design and optimization
35 Citations1975Michael Francis Mitoma, Keki B. Irani
This research is devoted to the development of a methodology to automate and optimize the design of DBTG schema structures, using analytic modelling and optimization techniques.
An algebra of relations for machine computation
33 Citations1975Patrick A. V. Hall, Peter B. Hitchcock +1 more
This paper extends the relational algebra of data bases, presented by Codd and others, in four areas: the use of selector names to remove order dependencies from the columns of a relation, a more general class of operations, and relations represented algorithmically as well as by a stored set of tuples.
An authorization model for a shared data base
29 Citations1975Eduardo B. Fernández, Rita C. Summers +1 more
The system is shown to provide comprehensive authorization, including implementation of levels and compartments, special access restrictions, content-dependent, context-dependent and functional access.
IEEE Transactions on Software EngineeringA Picture-Building System
28 Citations1976Robin L. Williams, Gary M. Giddings
The picture-building system (PBS) deals with the problem of creating and manipulating data structures for applications using computer graphics, which are defined in a relational data base and allow graphical attributes to be specified in the same way as nongraphical attributes.
Communications of the ACMThe evolution of storage structures
28 Citations1972Charles W. Bachman
The Data Structure Diagram graphic technique is used to illustrate the splitting of the concepts and the structural relations which exist between these concepts at each point in the evolution.
From information requirements to DBTG-data structures
27 Citations1976Janis A. Bubenko, Stig Berild +2 more
The problem of determining, analysis and description of a particular application's information structure and the process of mapping the information structure to a “good” data structure (in this case a DBTG-type structure) is considered and the applicability of a top-down oriented design procedure to a relatively large practical data base design case is demonstrated.
Journal of Clinical MedicineEfficient Evaluation of Expressions in a Relational Algebra.
27 Citations1975Robert M. Pecherer
The goal-directed intervention program for wheelchairs can be successfully implemented in a low-income setting with a high rate of goal achievement and frequent wheelchair use, facilitating participation, however, maintenance services are crucial to obtain sustainable results.
Is natural language an unnatural query language?
25 Citations1972Christine A. Montgomery
A novel approach integrating the treatment of form and meaning may provide an effective basis for handling natural language as an instrument of communication in automated systems.
Data base standardization
23 Citations1975Thomas B. Steel
An important by-product of the work of the Study Group on Data Base Management Systems in the United States has been the development of a set of requirements for effective data base management systems.
A multi-level architecture for relational data base systems
21 Citations1975Hans Albrecht Schmid, Philip A. Bernstein
A multi-level architecture for relational data base systems that distinguishes clearly between user oriented features, access path structures, data structures and file organization, and allows efficiency problems to be isolated within levels and solved independently of each other, without impacting the logical structure of the user's virtual machine.
Data description for computer-aided design
19 Citations1975Ann Ellis Bandurski, David K. Jefferson
The importance of DDLs in computer-aided design (CAD) is described and users of CAD systems are compared with users of business data processing systems, and are shown to have radically different skills, view data in different ways, and perform different operations upon data.
The data structure set model
18 Citations1975Cherles W. Bachman
The purpose of the discussion today is to increase the understanding of the basic concepts underlying data base structures and their models; to note the similarities and differences between them, and to determine their compatibility or the lack thereof.
On the equivalences of data based systems
18 Citations1975Edgar H. Sibley
The two major approaches to data base technology may be termed the relational or set theoretic, and the data structured or procedural, and there are obviously differences, but there are also similarities.
An approach to implementing a relational data management system
17 Citations1976James B. Rothnie
The bulk of the paper addresses the difficult problem of efficiently implementing relational selection criteria and proposes a technique for handling a subset of these retrieval requests and is sufficiently modular to admit the use of a wide variety of storage structures and search strategies.
IFIP CongressCurrent and Future Trends in Data Base Management Systems.
16 Citations1974T. William Olle
An energy-efficient, high throughput stereo-matching solution capable of real-time stereo matching for temporal statistical pattern projector systems that was developed using a high-level synthesis approach, matching cost simplification, and FPGA-specific design optimizations.
A functional view of data independence
15 Citations1976Michael Stonebraker
A framework for the isolation of a program from considerations of the data which it processes is provided and its ramifications are explored.
IFIP CongressThe Relational Approach to the Management of Data Bases.
14 Citations1971Alois J. Strnad
In patients with pancreatic body cancer, extended LND was associated with improved disease-free survival (DFS) and overall survival (P = 0.010), but had no survival benefit for the treatment of pancreatic tail cancer.
Investigations into the application of the relational model to data translation
12 Citations1975Shamkant B. Navathe, Alan G. Merten
On the basis of the accessing, manipulation and processing requirements in the current model of data translation, it is concluded that a software system must be designed to work with the relational Normal Forms and their modified versions.
The design of a rotating associative array memory for a relational data base management application
12 Citations1975C. S. Lin, Diane C. P. Smith
The design and usage of an associative array memory using a rotating storage device which is tailored to support the relational model of E. F. Codd is described.
Implications of data independence on the architecture of database management systems
11 Citations1972Arthur J. Collmeyer
It is the purpose of this paper to identify and elaborate on some of the problems associated with the design of a data-independent system.
File-level operations on network data structures
11 Citations1975W. C. McGee
This paper explores the extension of the concept of file-level operations to network structures, as exemplified by the CODASYL DDLC data structure class, on the assumption that such a facility will prove useful to certain types of users for certain kinds of data manipulation.
On the feasibility of implementing a large relational data base with optimal performance on a minicomputer
10 Citations1975Glenn K. Manacher
A less general model of Codd's relational model is proposed, for which queries and updates are maximally efficient and an alternative notion of "Normal form" is proposed for which the overhead for maintaining the form is truly minimal, and a set of efficient basic operations is proposed.
Evaluation of access authorization characteristics of derived data sets
9 Citations1971Richard Owens
The Computer JournalData manipulation language requirements for database management systems
9 Citations1974Roger Parsons
The Computer JournalA FORTRAN interface to the CODASYL database task group specifications
8 Citations1974G. M. Stacey
A schema for describing a relational data base
7 Citations1970Andrew J. Symonds, Raymond A. Lorie
The relational data management system
7 Citations1976James Steuert, Jay P. Goldman
The functional capabilities and economic features of the Relational Data Management System (RDMS) are discussed and the basic concepts of RDMS are introduced and the similarities between the conventional file concept and the relation concept are discussed.
An approach to proving the correctness of data base operations
6 Citations1972Igor Hawryszkiewycz, Jack B. Dennis
The approach to establishing correctness of semantic routines in the presence of concurrent system activities is described, which aims to provide a formal basis for investigating suitable semantic principles for data base systems where many users may be performing tasks concurrently.
Data administration and the DBTG report
6 Citations1976Robert W. Taylor
This paper demonstrates the use of a macro pre-processor which can increase data independence and greatly alleviate many of these shortcomings of the April, 1971 Data Base Task Group Report.
Efficient batch updating of a random file
6 Citations1971G. M. Nijssen
The method of how to efficiently update a random file in batch mode will be explained in this article, and if the available software can handle this type of processing will heavily influence the decision on whether to apply the indexed sequential method or the random method.
When are pointer arrays better than chains
5 Citations1974Robert Taylor
The DBTG introduced two modes of set implementation--chain and pointer array and the mode of a set indicates the strategy to be used by the data management system in moving from one record occurrence to another within the same set occurrence.
The Data Base Task Group Report: An Illustrative Example,
5 Citations1973Randall L. Frank, Edgar H. Sibley
The example presented was chosen to illustrate many of the complex data structuring and data manipulation mechanisms in the DBTG proposal.
…