Attribute based file organization in a paged memory environment
Communications of the ACM
A relational model of data for large shared data banks
Communications of the ACM
On optimizing an SQL-like nested query
ACM Transactions on Database Systems (TODS)
Decomposition—a strategy for query processing
ACM Transactions on Database Systems (TODS)
ACM Computing Surveys (CSUR)
Query Optimization in Database Systems
ACM Computing Surveys (CSUR)
Optimizing the performance of a relational algebra database interface
Communications of the ACM
Implementation of integrity constraints and views by query modification
SIGMOD '75 Proceedings of the 1975 ACM SIGMOD international conference on Management of data
Investigations into the application of the relational model to data translation
SIGMOD '75 Proceedings of the 1975 ACM SIGMOD international conference on Management of data
Data description for computer-aided design
SIGMOD '75 Proceedings of the 1975 ACM SIGMOD international conference on Management of data
A new way to compute the product and join of relations
SIGMOD '80 Proceedings of the 1980 ACM SIGMOD international conference on Management of data
Access control in a relational data base management system by query modification
ACM '74 Proceedings of the 1974 annual conference - Volume 1
The ADD system: an architecture for distributed databases
VLDB '78 Proceedings of the fourth international conference on Very Large Data Bases - Volume 4
INGRES: a relational data base system
AFIPS '75 Proceedings of the May 19-22, 1975, national computer conference and exposition
Evaluating inter-entry retrieval expressions in a relational data base management system
AFIPS '75 Proceedings of the May 19-22, 1975, national computer conference and exposition
| Hi-index | 0.02 |
One of the key developments in data base technology in recent years has been the introduction of the relation as a model for a data base and its manipulation language. This article begins with a very brief discussion of this concept particularly as it relates to the interlinking of file entries. 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. The suggested scheme is sufficiently modular to admit the use of a wide variety of storage structures and search strategies. The method has been implemented and example results of experiments with the technique are presented.