When is the evaluation of conjunctive queries tractable?
- 6 July 2001
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 657-666
- https://doi.org/10.1145/380752.380867
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- Query Evaluation via Tree-DecompositionsPublished by Springer Nature ,2001
- Hypertree decompositions and tractable queriesPublished by Association for Computing Machinery (ACM) ,1999
- Conjunctive-query containment and constraint satisfactionPublished by Association for Computing Machinery (ACM) ,1998
- On the complexity of database queries (extended abstract)Published by Association for Computing Machinery (ACM) ,1997
- Fixed-parameter tractability and completeness II: On completeness for W[1]Theoretical Computer Science, 1995
- Graph minors. V. Excluding a planar graphJournal of Combinatorial Theory, Series B, 1986
- The complexity of relational query languages (Extended Abstract)Published by Association for Computing Machinery (ACM) ,1982
- Optimal implementation of conjunctive queries in relational data basesPublished by Association for Computing Machinery (ACM) ,1977
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972