Paper Info
Title
On the feasibility of implementing a large relational data base with optimal performance on a minicomputer
Abstract
A less general model of Codd's relational model is proposed, for which queries and updates are maximally efficient. The differences in access method from Codd's are minor enough so that almost all the compactness of expression and quality of data independence remains. The first new mechanism is an "algebra" of dependencies superimposed on the set of relations. These dependencies, called "subsumptions", permit the data base designer to impose a structure on the set of relations, thereby joining them together into a shape reflecting the overall organization of the data. The second new mechanism is a new format in which fields are ordered, and lexical ordering of key values is enforced. It is shown that this format, used in conjunction with certain specific kinds of subsumptions, gives rise to a query sequence that is natural, linear, and intuitively related to access efficiency. Finally, 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.
Year
DOI
Venue
1975
10.1145/1282480.1282495
VLDB '75 Proceedings of the 1st International Conference on Very Large Data Bases
Keywords
Field
DocType
general model,access method,data base designer,efficient basic operation,new mechanism,new format,large relational data base,normal form,data independence,alternative notion,relational model,optimal performance,data definition,relational data,data base
Codd's theorem,Data mining,Relational calculus,Relational database,Computer science,Theoretical computer science,Relational Model/Tasmania,Relational algebra,Relational model,Hierarchical database model,Database,Data independence
Conference
Citations 
PageRank 
References 
12
31.33
18
Authors
1
Name
Order
Citations
PageRank
Glenn K. Manacher120598.95