The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
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 Introduction to Database Systems
An Introduction to Database Systems
Answering queries on embedded-complete database schemes
Journal of the ACM (JACM)
Ad Hoc Query: a reusable database access capability
WADAS '94 Proceedings of the eleventh annual Washington Ada symposium & summer ACM SIGAda meeting on Ada
On the foundations of the universal relation model
ACM Transactions on Database Systems (TODS)
Construction of relations in relational databases
ACM Transactions on Database Systems (TODS)
Query Optimization in Database Systems
ACM Computing Surveys (CSUR)
SIGMOD '83 Proceedings of the 1983 ACM SIGMOD international conference on Management of data
Optimal computation of total projections with unions of simple chase join expressions
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
A sophisticate's introduction to database normalization theory
VLDB '78 Proceedings of the fourth international conference on Very Large Data Bases - Volume 4
Towards a universal relation interface
VLDB '79 Proceedings of the fifth international conference on Very Large Data Bases - Volume 5
An overview of recent data base research
ACM SIGMIS Database
| Hi-index | 0.00 |
Let R be a relational database containing relations {R1,R2,…,Rn}. For each relation Ri, 1 ≤ i ≤ n, let Di = {di,1,di,2,…} be its set of domains and let Ki = {ki,1,ki,2,…} ⊆ Di be its set of primary keys. Finally, let D = {D1,D2,…,Dn} and K = {K1,K2,…,Kn}. Suppose that a user of database R wishes to create a new relation, Rn+1, whose domains are Dn+1 ⊆ ? Dj. In this paper, the authors describe an algorithm which, given D K, and Dn+1, determines a sequence of joins to generate Rn+1 from R1,…,Rn (if such a sequence exists). Theoretical and empirical computing times of the algorithm are discussed. A new relational database system employing the algorithm is outlined.