Abstract
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.
Original language | English |
---|---|
Title of host publication | Proceedings of the 1st ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, PODS 1982 |
Publisher | Association for Computing Machinery |
Pages | 55-62 |
Number of pages | 8 |
ISBN (Print) | 0897910702 |
DOIs | |
State | Published - 29 Mar 1982 |
Event | 1st ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, PODS 1982 - Los Angeles, United States Duration: 29 Mar 1982 → 31 Mar 1982 |
Publication series
Name | Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems |
---|
Conference
Conference | 1st ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, PODS 1982 |
---|---|
Country/Territory | United States |
City | Los Angeles |
Period | 29/03/82 → 31/03/82 |
Bibliographical note
Publisher Copyright:© 1982 ACM.