Limitations of record-based information models
ACM Transactions on Database SystemsPublished 1 March 1979
William Kent
Citations209
SJR quartileQ1
SJR score0.91
SNIP1.85
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.
TL;DR
Record structures are generally efficient, familiar, and easy to use for most current data processing applications, but they are not complete in their ability to represent information, nor are they fully self-describing.
Abstract
Record structures are generally efficient, familiar, and easy to use for most current data processing applications. But they are not complete in their ability to represent information, nor are they fully self-describing.
Keywords
Computer Science
The Entity Relationship Model — Toward a Unified View of Data
5,769 Citations2002Peter Pin-Shan Chen
A data model, called the entity-relationship model, is proposed that incorporates some of the important semantic information about the real world and can be used as a basis for unification of different views of data: the network model, the relational model, and the entity set model.
Communications of the ACMA relational model of data for large shared data banks
5,238 Citations1970E. F. Codd
A model based on n-ary relations, a normal form for data base relations, and the concept of a universal data sublanguage are introduced and certain operations on relations are discussed and applied to the problems of redundancy and consistency in the user's model.
Communications of the ACMA relational model of data for large shared data banks
4,834 Citations1983E. F. Codd
ACM Transactions on Database SystemsThe entity-relationship model—toward a unified view of data
4,648 Citations1976Peter Pin-Shan Chen
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.
ACM Transactions on Database SystemsDatabase abstractions
1,401 Citations1977John Miles Smith, Diane C. P. Smith
A triggering mechanism for automatically maintaining these invariants during update operations is proposed, and a simple mapping of aggregation/generalization hierarchies onto owner-coupled set structures is given.
ACM Transactions on Database SystemsMultivalued dependencies and a new normal form for relational databases
720 Citations1977Ronald Fagin
It is shown that every relation schema can be decomposed into a family of relation schemata in fourth normal form without loss of information (that is, the original relation can be obtained from the new relations by taking joins).
IBM Journal of Research and DevelopmentConceptual Graphs for a Data Base Interface
359 Citations1976John F. Sowa
This paper defines a formalism, called conceptual graphs, that can describe data according to the user's view and access dataaccording to the system's view that can represent functional dependencies in the data base and support inferences and computations that are not explicit in the initial query.
Communications of the ACMDatabase abstractions
291 Citations1977John Miles Smith, Diane C. P. Smith
It is suggested that aggregate types, and other types which support real-world abstractions without introducing implementation detail, should be incorporated into programming languages.
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.
Very Large Data BasesThe role concept in data models
156 Citations1977Charles W. Bachman, Manilal Daya
This paper shows that the record and role segment concepts can be integrated into the required data description and data manipulation language.
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.
ACM Computing SurveysCODASYL Data-Base Management Systems
142 Citations1976Robert W. Taylor, Randall L. Frank
This paper presents in tutorial fashion the concepts, notation, features, and examples of the data-base languages that were defined by the CODASYL Data Description Language and Programming Language Committees.
ACM Computing SurveysHierarchical Data-Base Management: A Survey
124 Citations1976D. Tsichritzis, Frederick H. Lochovsky
This survey paper discusses the facilities provided by hierarchical data-base management systems and a brief comparison is made between the hierarchical, the network, and the relational systems.
Using semantic networks for data base management
85 Citations1975N. Roussopoulos, John Mylopoulos
This paper presents a semantic model of data bases that assumes the availability of a semantic network storing knowledge about a data base and a set of attributes for the data base.
Information SystemsSemantics of data bases: The semantics of data models
70 Citations1978Horst Biller, Erich Neuhold
An abstract data model is introduced which is suited to express the semantics of schemas respectively data instances and a logical data definition language and logical data language are proposed which allow to specify the kind of information which may be stored in the data base and which ensures the correctness and consistency of this information.
Information SystemsInformation systems: Records, relations, sets, entities, and things
52 Citations1975Michael E. Senko
This discussion relys on the definition of a series of abstract, structured levels for the description, design, and implementation of generalized data base management systems.
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”.
Information SystemsSignifications: The key to unify data base management
17 Citations1976Eckhard D. Falkenberg
It is proposed to base the various data base management functions on one principle, a special kind of linguistic expressions, called significations, that may serve as such a common principle.
International Conference on Software EngineeringA Synthetic English query language for a relational associative processor
14 Citations1976Larry Kerschberg, Esen A. Ozkarahan +1 more
RAP is an associative and cellular back-end processor designed to support relational data bases and its high-level machine language and query processing philosophy make the interface to Synthetic English extremely efficient, avoiding intermediate-level code generation.
Very Large Data BasesNew criteria for the conceptual model
12 Citations1976William Kent
In the three-level approach to data description, the conceptual or information level is supposed to provide a data independent model of the enterprise's information.
Information SystemsTwo major flaws in the CODASYL DDL 1973 and proposed corrections
11 Citations1975G. M. Nijssen
The corrected DDL is functionally equivalent, yet offers more data independence, is simpler and more orthogonal, and the major issue of the “great debate” between the network (CODASYL) and relational data base approach is concentrated on.