Data base organization for data management (2nd ed.)
Data base organization for data management (2nd ed.)
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Independent components of relations
ACM Transactions on Database Systems (TODS)
A relational model of data for large shared data banks
Communications of the ACM
SIGMOD '75 Proceedings of the 1975 ACM SIGMOD international conference on Management of data
A generalized access path model and its application to a relational data base system
SIGMOD '76 Proceedings of the 1976 ACM SIGMOD international conference on Management of data
An algorithm for servicing multi-relational queries
SIGMOD '77 Proceedings of the 1977 ACM SIGMOD international conference on Management of data
Problem-Solving Methods in Artificial Intelligence
Problem-Solving Methods in Artificial Intelligence
On the foundations of the universal relation model
ACM Transactions on Database Systems (TODS)
U2RS: an upgradable universal relation system
CSC '88 Proceedings of the 1988 ACM sixteenth annual conference on Computer science
SIGMOD '83 Proceedings of the 1983 ACM SIGMOD international conference on Management of data
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
| Hi-index | 0.00 |
Using a nonprocedural language for query formulation requires certain automatization of a query answering process. Given a query for creation of a new relation, the problem is to find an efficient procedure which produces this relation from a given relational database. We concentrate upon sequences of join operations which losslessly produce a relation required by a query. A new property of such sequences is analyzed which provides a basis for the presented algorithms that construct an efficient join procedure. The algorithms have polynomial complexity. A modified AND/OR graph is used for the display of a given set of dependencies and a collection of relations representing a database.