Complexity of answering queries using materialized views
- 1 May 1998
- proceedings article
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 254-263
- https://doi.org/10.1145/275487.275516
Abstract
No abstract availableKeywords
This publication has 28 references indexed in Scilit:
- Conjunctive query containment with respect to views and constraintsInformation Processing Letters, 1996
- Recursively indefinite databasesTheoretical Computer Science, 1993
- Equivalence of Datalog queries is undecidableThe Journal of Logic Programming, 1993
- On the representation and querying of sets of possible worldsTheoretical Computer Science, 1991
- On conjunctive queries containing inequalitiesJournal of the ACM, 1988
- Querying logical databasesJournal of Computer and System Sciences, 1986
- Incomplete Information in Relational DatabasesJournal of the ACM, 1984
- Equivalences Among Relational Expressions with the Union and Difference OperatorsJournal of the ACM, 1980
- Efficient optimization of a class of relational expressionsACM Transactions on Database Systems, 1979
- A variant of a recursively unsolvable problemBulletin of the American Mathematical Society, 1946