Deciding containment for queries with complex objects (extended abstract)
- 1 May 1997
- proceedings article
- Published by Association for Computing Machinery (ACM)
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- The power of languages for the manipulation of complex valuesThe VLDB Journal, 1995
- Principles of programming with complex objects and collection typesTheoretical Computer Science, 1995
- Equivalence of Datalog queries is undecidableThe Journal of Logic Programming, 1993
- Converting nested algebra expressions into flat algebra expressionsACM Transactions on Database Systems, 1992
- Using powerdomains to generalize relational databasesTheoretical Computer Science, 1991
- On a hierarchy of classes for nested databasesInformation Processing Letters, 1990
- Multilevel nested relational structuresJournal of Computer and System Sciences, 1988
- On conjunctive queries containing inequalitiesJournal of the ACM, 1988
- Extending relational algebra and relational calculus with set-valued attributes and aggregate functionsACM Transactions on Database Systems, 1987
- Equivalences Among Relational Expressions with the Union and Difference OperatorsJournal of the ACM, 1980