Conjunctive query containment revisited
- 28 May 2000
- journal article
- Published by Elsevier BV in Theoretical Computer Science
- Vol. 239 (2), 211-229
- https://doi.org/10.1016/s0304-3975(99)00220-0
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Zero knowledge and the chromatic numberPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Optimizing queries with materialized viewsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination TreeJournal of Algorithms, 1995
- Optimization of a subclass of conjunctive queriesActa Informatica, 1995
- A linear time algorithm for finding tree-decompositions of small treewidthPublished by Association for Computing Machinery (ACM) ,1993
- Complexity of Finding Embeddings in a k-TreeSIAM Journal on Algebraic Discrete Methods, 1987
- Optimizing Conjunctive Queries that Contain Untyped VariablesSIAM Journal on Computing, 1983
- Efficient optimization of a class of relational expressionsACM Transactions on Database Systems, 1979
- Equivalences among Relational ExpressionsSIAM Journal on Computing, 1979
- Optimal implementation of conjunctive queries in relational data basesPublished by Association for Computing Machinery (ACM) ,1977