Query processing in a system for distributed databases (SDD-1)
ACM Transactions on Database Systems (TODS)
On optimizing an SQL-like nested query
ACM Transactions on Database Systems (TODS)
Optimization of query evaluation algorithms
ACM Transactions on Database Systems (TODS)
Decomposition—a strategy for query processing
ACM Transactions on Database Systems (TODS)
Approximating block accesses in database organizations
Communications of the ACM
A relational model of data for large shared data banks
Communications of the ACM
Access path selection in a relational database management system
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
Designing globally consistent network schemas
SIGMOD '83 Proceedings of the 1983 ACM SIGMOD international conference on Management of data
Query optimization for CODASYL database systems
SIGMOD '82 Proceedings of the 1982 ACM SIGMOD international conference on Management of data
A universal relation database system implemented via the network model
PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
A design methodology for a universal relation scheme implementation via codasyl
A design methodology for a universal relation scheme implementation via codasyl
GENESIS: An Extensible Database Management System
IEEE Transactions on Software Engineering
Query evaluation techniques for large databases
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |
New methods for retrieving records from a database with links are given so that records are retrieved only once and not multiple times as happens when using the traditional method of retrieval Improvements as great as 50 percent are expected for queries over databases containing only many-to-one relationships and much greater improvements are expected when many-to-many relationships are embedded in the database Furthermore, it is shown how to combine relational and network retrieval methods Relations, containing many tuples, are created during the evaluation of a network query Each relation is either joined with other relations or is used to continue the evaluation of the network query The methods given show how to optimize data retrieval from a relational database that is implemented using links, where each link represents a many-to-one relationship