Database theory column
- 1 August 1990
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGACT News
- Vol. 21 (3) , 9-18
- https://doi.org/10.1145/101368.101370
Abstract
Complex object databases have been proposed as a significant extension of relational databases, with many practical applications. In the second database theory column, we present languages for the manipulation of such databases: a many-sorted algebra and an equivalent calculus. Without attempting to standardize, we try to provide general and short definitions that highlight the two key constructors of complex objects: tuples and (finite) sets. We comment on issues, such as language expressive power and complexity, and we describe equivalent rule-based languages with fixpoint semantics. Finally, we review the state-of-the art in database complex objects and list some interesting open questions.Keywords
This publication has 23 references indexed in Scilit:
- COL: a logic-based language for complex objectsPublished by Association for Computing Machinery (ACM) ,1990
- Object identity as a query language primitivePublished by Association for Computing Machinery (ACM) ,1989
- Object-oriented database systemsPublished by Association for Computing Machinery (ACM) ,1988
- Procedural and declarative database update languagesPublished by Association for Computing Machinery (ACM) ,1988
- IFO: a formal semantic database modelACM Transactions on Database Systems, 1987
- Sets and negation in a logic data base language (LDL1)Published by Association for Computing Machinery (ACM) ,1987
- Non First Normal Form relations: An algebra allowing data restructuringJournal of Computer and System Sciences, 1986
- A calculus for complex objectsPublished by Association for Computing Machinery (ACM) ,1985
- Computable queries for relational data basesJournal of Computer and System Sciences, 1980
- Universality of data retrieval languagesPublished by Association for Computing Machinery (ACM) ,1979