Binary Search Trees and File Organization
ACM Computing Surveys (CSUR)
Analysis and performance of inverted data base structures
Communications of the ACM
Communications of the ACM
A relational model of data for large shared data banks
Communications of the ACM
The Art of Computer Programming, 2nd Ed. (Addison-Wesley Series in Computer Science and Information
The Art of Computer Programming, 2nd Ed. (Addison-Wesley Series in Computer Science and Information
Treating hierarchical data structures in the SDC Time-Shared Data Management System (TDMS)
ACM '67 Proceedings of the 1967 22nd national conference
High level operations in automatic programming
Proceedings of the ACM SIGPLAN symposium on Very high level languages
On interaction with data bases
SIGFIDET '74 Proceedings of the 1974 ACM SIGFIDET (now SIGMOD) workshop on Data description, access and control
The relational and network approaches: Comparison of the application programming interfaces
SIGFIDET '74 Proceedings of the 1974 ACM SIGFIDET (now SIGMOD) workshop on Data description, access and control: Data models: Data-structure-set versus relational
Data structures and data accessing in data base systems past, present, future
IBM Systems Journal
| Hi-index | 0.00 |
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.