On the complexity of the containment problem for conjunctive queries with built-in predicates
- 1 May 1998
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 197-204
- https://doi.org/10.1145/275487.275510
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- The closure of Monadic NP (extended abstract)Published by Association for Computing Machinery (ACM) ,1998
- The Complexity of Querying Indefinite Data about Linearly Ordered DomainsJournal of Computer and System Sciences, 1997
- Answering queries using templates with binding patterns (extended abstract)Published by Association for Computing Machinery (ACM) ,1995
- Answering queries using views (extended abstract)Published by Association for Computing Machinery (ACM) ,1995
- On conjunctive queries containing inequalitiesJournal of the ACM, 1988
- The complexity of evaluating relational queriesInformation and Control, 1983
- The complexity of facets (and some facets of complexity)Published by Association for Computing Machinery (ACM) ,1982
- Optimal implementation of conjunctive queries in relational data basesPublished by Association for Computing Machinery (ACM) ,1977