ACM Home Page
Please provide us with feedback. Feedback
Relations with relation names as arguments: algebra and calculus
Full text PdfPdf (774 KB)
Source Symposium on Principles of Database Systems archive
Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems table of contents
San Diego, California, United States
Pages: 346 - 353  
Year of Publication: 1992
ISBN:0-89791-519-4
Author
Sponsors
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGART: ACM Special Interest Group on Artificial Intelligence
SIGMOD: ACM Special Interest Group on Management of Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 18,   Citation Count: 14
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/137097.137905
What is a DOI?

ABSTRACT

We consider a version of the relational model in which relation names may appear as arguments of other relations. Allowing relation names as arguments provides enhanced modelling capabilities, allowing some object-oriented features to be expressed within the relational model. We extend relational algebra with operators for accessing relations, and also define a relational calculus based on the logic HiLog. We prove two equivalence results between extensions of relational algebra provide higher expressive power than relational algebra on any given database. Finally, we argue that the extensions proposed here are relatively easy to provide in practice, and should be expressible within modern query languages.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
C+76
D.D. Chamberlin et al. SEQUEL 2: A unified approach to data definition, manipulation and control. IBM Journal of Research and Develipment, 20(6):560- 575, 1976.
 
CKW89
W. Chen, M. Kifer, and D. S. Warren. ttiLog: A first order semantics for higher-order logic programming constructs. In Proc. Norih American Logic Programming Conference, 1989.
Cod70
 
Cod72
E. F. Codd. Relational completeness of data base sublanguages. Data Base Systems, pages 65-98, 1972.
DiP69
Klu82
PDR91
Ros91
SS77
 
Ull89
J.D. V11m n. of Knowledge Base Systems. Computer Science Press, Rockville, MD, 1989. (Two volumes).

CITED BY  14