The theory of joins in relational databases
ACM Transactions on Database Systems (TODS)
A language facility for designing database-intensive applications
ACM Transactions on Database Systems (TODS)
The design and implementation of INGRES
ACM Transactions on Database Systems (TODS)
Database abstractions: aggregation and generalization
ACM Transactions on Database Systems (TODS)
Principles of Database Systems
Principles of Database Systems
Improving semantic specification in a relational database
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
SYSTEM/U: a database system based on the universal relation assumption
ACM Transactions on Database Systems (TODS)
Resolving the query inference problem using Steiner trees
ACM Transactions on Database Systems (TODS)
SIGMOD '83 Proceedings of the 1983 ACM SIGMOD international conference on Management of data
Inclusion dependencies and the universal instance
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
Inference rules for functional and inclusion dependencies
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
Inclusion dependencies and their interaction with functional dependencies
PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
On the Properties of Extended Inclusion Dependencies
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
Independent Database Schemes under Functional and Inclusion Dependencies
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
LAURA: A Formal Data Model and her Logical Design Methodology
VLDB '83 Proceedings of the 9th International Conference on Very Large Data Bases
| Hi-index | 0.00 |
The problem of entities that play multiple roles in a relational database is studied, with an emphasis on the universal relation view of the database. A tree structure is used to describe the compatibilities among attributes. The compatibility information for an attribute encodes role playing information that cannot be described by traditional data dependencies. This structure is used to define the semantics of a QUEL-like (Stonebraker et al. [1976]) query language that uses special naming rules to permit easy use of attribute compatibility