Containment of conjunctive queries over databases with null values

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4353 LNCS, Issue , 2006, Pages 389-403

  Farré, Carles ^a   Nutt, Werner ^b   Teniente, Ernest ^a   Urpí, Toni ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^b FREE UNIVERSITY OF BOZEN BOLZANO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN QUERIES; CONJUNCTIVE QUERIES; NP COMPLETE; NULL VALUE; TEST PREDICATES;

SEMANTICS;

DATABASE SYSTEMS;

EID: 57349164541     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11965893_27     Document Type: Conference Paper

References (18)

1. D. Calvanese, G. D. Giacomo, M. Lenzerini, and M. Y. Vardi. Containment of conjunctive regular path queries with inverse. In Proc. 7th KR, pages 176-185, 2000.
2. D. Calvanese, G. D. Giacomo, and M. Y. Vardi. Decidable containment of recursive queries. In Proc. 9th ICDT, pages 1-18, 2003.
3. A. Chandra and P. Merlin. Optimal implementation of conjunctive queries in relational databases. In Proc. 9th STOC, 1977.
4. S. Chaudhuri and M. Vardi. Optimization of real conjunctive queries. In Proc. 12th PODS, 1993.
5. S. Cohen, W. Nutt, and Y. Sagiv. Containment of aggregate queries. In Proc. 9th ICDT, 2003.
6. M. Fernandez, D. Florescu, A. Levy, and D. Suciu. Verifying integrity constraints on web-sites. In Proc. 16th IJCAI, pages 614-619, 1999.
7. H. Garcia-Molina, J. Ullman, and J. Widom. Database Systems: The Complete Book. Pearson Education International, 2002.
8. A. Klug. On conjunctive queries containing inequalities. J. ACM, 35(1):146-160, 1988.
9. P. Kolaitis, D. Martin, and M. Thakur. On the complexity of the containment problem for conjunctive queries with built-in predicates. In Proc. 17th PODS, pages 197-204, 1998.
10. A. Levy, A. Mendelzon, Y. Sagiv, and D. Srivastava. Answering queries using views. In Proc. 14th PODS, pages 95-104, 1995.
11. A. Levy and Y. Sagiv. Queries independent of updates. In Proc. 19th VLDB, pages 171-181, 1993.
12. G. Miklau and D. Suciu. Containment and equivalence for an XPath fragment. In Proc. 21st PODS, pages 65-76, 2002.
13. L. Popa and V. Tannen. An equational chase for path-conjunctive queries, constraints, and views. In Proc. 7th ICDT, pages 39-57, 1999.
14. Y. Sagiv and Y. Saraiya. Minimizing restricted-fanout queries. Discrete Applied Mathematics, 40:245-264, 1992.
15. Y. Sagiv and M. Yannakakis. Equivalence among relational expressions with the union and difference operators. J. ACM, 27(4):633-655, 1981.
16. O. Shmueli. Equivalence of datalog programs is undecidable. Theoretical Computer Science, 15(3):231-242, 1993.
17. J. Ullman. Information integration using logical views. In Proc. 6th ICDT, pages 19-40, 1997.
18. R. van der Meyden. The complexity of querying indefinite data about linearly ordered domains. J. Computer and System Sciences, 54(1):113-135, 1997.