Implementing a generalized access path structure for a relational database system
- 1 September 1978
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Database Systems
- Vol. 3 (3) , 285-298
- https://doi.org/10.1145/320263.320284
Abstract
A new kind of implementation technique for access paths connecting sets of tuples qualified by attribute values is described. It combines the advantages of pointer chain and multilevel index implementation techniques. Compared to these structures the generalized access path structure is at least competitive in performing retrieval and update operations, while a considerable storage space saving is gained. Some additional features of this structure support m -way joins and the evaluation of multirelation queries, and allow efficient checks of integrity assertions and simple reorganization schemes.Keywords
This publication has 4 references indexed in Scilit:
- System RACM Transactions on Database Systems, 1976
- On semantic issues in the relational model of dataPublished by Springer Nature ,1976
- Functional specifications of a subsystem for data base integrityPublished by Association for Computing Machinery (ACM) ,1975
- A relational model of data for large shared data banksCommunications of the ACM, 1970