Warning: Full texts from electronic resources are only available from the university network. You are currently outside this network. Please log in to access full texts
Towards A Universal Relation Interface
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, reconstructib...
Saved in:
Published in | Fifth International Conference on Very Large Data Bases, 1979 pp. 52 - 60 |
---|---|
Main Author | |
Format | Conference Proceeding |
Language | English |
Published |
IEEE
1979
|
Subjects | |
Online Access | Get full text |
DOI | 10.1109/VLDB.1979.718118 |
Cover
Summary: | 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. |
---|---|
DOI: | 10.1109/VLDB.1979.718118 |