Synthesizing third normal form relations from functional dependencies
ACM Transactions on Database Systems (TODS)
Multivalued dependencies and a new normal form for relational databases
ACM Transactions on Database Systems (TODS)
Independent components of relations
ACM Transactions on Database Systems (TODS)
Journal of the ACM (JACM)
Optimizing the performance of a relational algebra database interface
Communications of the ACM
Efficient optimization of a class of relational expressions
SIGMOD '78 Proceedings of the 1978 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
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
SEQUEL: A structured English query language
SIGFIDET '74 Proceedings of the 1974 ACM SIGFIDET (now SIGMOD) workshop on Data description, access and control
| Hi-index | 0.00 |
It is shown that it is possible to automatically generate all valid answers to a query on a relational data base such that the user need not be aware of the relations used to form the answer, but can express queries simply in terms of attribute names. If the data base is in a covering, reconstructible Codd third normal form, then algorithms can be given to generate the data base joins necessary to answer such a query.