On the decidability of query containment under constraints
- 1 May 1998
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 149-158
- https://doi.org/10.1145/275487.275504
Abstract
No abstract availableThis publication has 20 references indexed in Scilit:
- Conjunctive query containment with respect to views and constraintsInformation Processing Letters, 1996
- Containment of conjunctive queriesACM Transactions on Database Systems, 1995
- On conjunctive queries containing inequalitiesJournal of the ACM, 1988
- Automata-theoretic techniques for modal logics of programsJournal of Computer and System Sciences, 1986
- The Implication Problem for Functional and Inclusion Dependencies is UndecidableSIAM Journal on Computing, 1985
- Testing containment of conjunctive queries under functional and inclusion dependenciesJournal of Computer and System Sciences, 1984
- The implication problem for functional and inclusion dependenciesInformation and Control, 1983
- 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
- Propositional dynamic logic of regular programsJournal of Computer and System Sciences, 1979