Conjunctive query containment revisited

Theoretical Computer Science

Volumn 239, Issue 2, 2000, Pages 211-229

  Chekuri, Chandra ^a   Rajaraman, Anand ^b  

^a LUCENT TECHNOLOGIES   (United States)

^b AMAZON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0003505668     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(99)00220-0     Document Type: Article

References (24)

1. A.V. Aho, Y. Sagiv, J.D. Ullman, Efficient optimization of a class of relational expressions, ACM Trans. Database Systems 4(4) (1979) 435-454.
2. A.V. Aho, Y. Sagiv, J.D. Ullman, Equivalence of relational expressions, SIAM J. Comput. 8(2) (1979) 218-246.
3. S. Arnborg, D. Corneil, A. Proskurowski, Complexity of finding embeddings in a k-tree, SIAM J. Algebraic Discrete Methods 8 (1987) 277-284.
4. J. Biskup, P. Dublish, Y. Sagiv, Optimization of a subclass of conjunctive queries, Acta Inform. 32(1) (1995) 1-26.
5. H.L. Bodlaender, A linear time algorithm for finding tree-decompositions of small treewidth, Proc. 25th ACM Symp. on the Theory of Computing, 1993, pp. 226-234.
6. H. Bodlaender, J. Gilbert, H. Hafsteinsson, T. Kloks, Approximating treewidth, pathwidth, frontsize, and shortest elimination tree, J. Algorithms 18(2) (1995) 238-255.
7. A.K. Chandra, P.M. Merlin, Optimal implementation of conjunctive queries in relational databases, Proc. 9th ACM Symp. on Theory of Computing, 1977, pp. 77-90.
8. S. Chaudhuri, R. Krishnamurthy, S. Potamianos, K. Shim, Optimizing queries with materialized views, Proc. 11th Internat. Conf. on Data Engineering, 1995, pp. 190-200.
9. U. Feige, J. Kilian, Zero knowledge and the chromatic number, Proc. 11th Ann. IEEE Conf. on Computational Complexity, 1996, pp. 278-287.
10. M.H. Graham, On the universal relation, Technical Report, University of Toronto, Ontario, Canada, 1979.
11. 1-ε, Proc. 37th Ann. Symp. on Foundations of Computer Science, 1996, pp. 627-636.
12. D.S. Johnson, A. Klug, Optimizing conjunctive queries that contain untyped variables, SIAM J. Comput. 12(4) (1983) 616-640.
13. S. Khanna, R. Motwani, Towards a syntactic characterization of PTAS, Proc. 28th ACM Symp. on the Theory of Computing, 1996.
14. P.A. Larson, H.Z. Yang, Computing queries from derived relations, Proc. 11th Internat. Conf. on Very Large Data Bases, 1985, pp. 259-269.
15. A.Y. Levy, A.O. Mendelzon, Y. Sagiv, D. Srivastava, Answering queries using views, Proc. 14th ACM Symp. on Principles of Database Systems, 1995, pp. 95-104.
16. A.Y. Levy, A. Rajaraman, J.J. Ordille, Querying heterogeneous information sources using source descriptions, Proc. 22nd Internat. Conf. on Very Large Data Bases, 1996.
17. A.Y. Levy, A. Rajaraman, J.D. Ullman, Answering queries using limited external query processors, Proc. 15th ACM Symp. on Principles of Database Systems, 1996, pp. 227-237.
18. X. Qian, Query folding, Proc. 12th Internat. Conf. on Data Engineering, 1996.
19. A. Rajaraman, Y. Sagiv, J.D. Ullman, Answering queries using templates with binding patterns, Proc. 14th ACM Symp. on Principles of Database Systems, 1995, pp. 105-112.
20. R.E. Tarjan, M. Yannakakis, Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs, SIAM J. Comput. 13(3) 1984, 566-579.
21. J.D. Ullman, Principles of Database and Knowledge-Base Systems, Vol. II: The New Technologies, Computer Science Press, Rockville, MD, 1989.
22. H.Z. Yang, P.A. Larson, Query transformation for PSJ-queries, Proc. 13th Internat. Conf. on Very Large Data Bases, 1987, pp. 245-254.
23. M. Yannakakis, Algorithms for acyclic database schemes, Proc. 7th Internat. Conf. on Very Large Data Bases, 1981, pp. 82-94.
24. C.T. Yu, M.Z. Ozsoyoglu, An algorithm for tree-query membership of a distributed query, Proc. IEEE COMPSAC (1979) pp. 306-312.