Compatible attributes in a universal relation

Catriel Beeri, Henry F. Korth

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

14 Scopus citations

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 languageEnglish
Title of host publicationProceedings of the 1st ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, PODS 1982
PublisherAssociation for Computing Machinery
Pages55-62
Number of pages8
ISBN (Print)0897910702
DOIs
StatePublished - 29 Mar 1982
Event1st ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, PODS 1982 - Los Angeles, United States
Duration: 29 Mar 198231 Mar 1982

Publication series

NameProceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

Conference

Conference1st ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, PODS 1982
Country/TerritoryUnited States
CityLos Angeles
Period29/03/8231/03/82

Bibliographical note

Publisher Copyright:
© 1982 ACM.

Fingerprint

Dive into the research topics of 'Compatible attributes in a universal relation'. Together they form a unique fingerprint.

Cite this