Conjunctive query containment revisited

This publication has 12 references indexed in Scilit:

• An algorithm for tree-query membership of a distributed query
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2005
• Query folding
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• Optimizing queries with materialized views
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• Towards a syntactic characterization of PTAS
  Published by Association for Computing Machinery (ACM) ,1996
• A linear time algorithm for finding tree-decompositions of small treewidth
  Published by Association for Computing Machinery (ACM) ,1993
• Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
  SIAM Journal on Computing, 1984
• Optimizing Conjunctive Queries that Contain Untyped Variables
  SIAM Journal on Computing, 1983
• Efficient optimization of a class of relational expressions
  ACM Transactions on Database Systems, 1979
• Equivalences among Relational Expressions
  SIAM Journal on Computing, 1979
• Optimal implementation of conjunctive queries in relational data bases
  Published by Association for Computing Machinery (ACM) ,1977