Containment of conjunctive queries on annotated relations

ACM International Conference Proceeding Series

Volumn 361, Issue , 2009, Pages 296-309

  Green, Todd J ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONJUNCTIVE QUERIES; CONTAINMENT MAPPING; DECISION PROCEDURE; LARGE CLASS; RELATIONAL QUERIES; SEMI-RING; SET SEMANTICS;

COMPUTABILITY AND DECIDABILITY; EQUIVALENCE CLASSES; SEMANTICS; SET THEORY;

QUERY LANGUAGES;

EID: 70349140509     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1514894.1514930     Document Type: Conference Paper

References (34)

1. L. Antova, C. Koch, and D. Olteanu. From complete to incomplete information and back. In SIGMOD, 2007.
2. S. Bistarelli. Semirings for Soft Constraint Solving and Programming. Springer, 2004.
3. P. Buneman, J. Cheney, W.-C. Tan, and S. Vansummeren. Curated databases. In PODS, 2008.
4. P. Buneman, S. Khanna, and W.-C. Tan. Why and where: A characterization of data provenance. In ICDT, 2001.
5. P. Buneman, S. Khanna, and W. C. Tan. On propagation of deletions and annotations through views. In PODS, 2002.
6. A. K. Chandra and P. M. Merlin. Optimal implementation of conjunctive queries in relational data bases. In STOC, pages 77-90, 1977.
7. S. Chaudhuri and M. Y. Vardi. On the equivalence of recursive and nonrecursive datalog programs. In PODS, 1992.
8. S. Chaudhuri and M. Y. Vardi. Optimization of real conjunctive queries. In PODS, 1993.
9. S. Cohen. Containment of aggregate queries. SIGMOD Record, 34(1):77-85, 2005.
10. S. Cohen. Equivalence of queries combining set and bag-set semantics. In PODS, 2006.
11. S. Cohen, W. Nutt, and A. Serebrenik. Rewriting aggregate queries using views. In PODS, 1999.
12. S. Cohen, Y. Sagiv, and W. Nutt. Equivalences among aggregate queries with negation. ACM TOCL, 6(2):328-360, April 2005.
13. Y. Cui, J. Widom, and J. L. Wiener. Tracing the lineage of view data in a warehousing environment. TODS, 25(2), 2000.
14. J. N. Foster, T. J. Green, and V. Tannen. Annotated XML: Queries and provenance. In PODS, 2008.
15. N. Fuhr and T. Rölleke. A probabilistic relational algebra for the integration of information retrieval and database systems. TOIS, 14(1):32-66, 1997.
16. G. Grahne, N. Spyratos, and D. Stamate. Semantics and containment of queries with internal and external conjunctions. In ICDT, 1997.
17. T. J. Green, Z. G. Ives, and V. Tannen. Reconcilable differences. In ICDT, 2009.
18. T. J. Green, G. Karvounarakis, Z. G. Ives, and V. Tannen. Update exchange with mappings and provenance. In VLDB, 2007.
19. T. J. Green, G. Karvounarakis, and V. Tannen. Provenance semirings. In PODS, 2007.
20. T. J. Green and V. Tannen. Models for incomplete and probabilistic information. In IIDB, March 2006.
21. P. Hell and J. Nešetřil. Graphs and Homomorphisms. Oxford University Press, 2004.
22. T. Imieliński and J. Witold Lipski. Incomplete information in relational databases. J. ACM, 31(4), 1984.
23. Y. E. Ioannidis and R. Ramakrishnan. Containment of conjunctive queries: Beyond relations as sets. TODS, 20(3):288-324, 1995.
24. T. S. Jayram, P. G. Kolaitis, and E. Vee. The containment problem for real conjunctive queries with inequalities. In PODS, 2006.
25. J. Köbler, U. Schöning, and J. Torán. The Graph Isomorphism Problem: its Structural Complexity. Birkhäuser Verlag, 1993.
26. L. V. S. Lakshmanan and N. Shiri. A parametric approach to deductive databases with uncertainty. IEEE Trans. Knowl. Data Eng., 13(4):554-570, 2001.
27. L. Lovász. Operations with structures. Acta Mathematica Hungarica, 18(3-4):321-328, 1967.
28. W. Nutt, Y. Sagiv, and S. Shurin. Deciding equivalences among aggregate queries. In PODS, 1998.
29. Y. Sagiv and M. Yannakakis. Equivalences among relational expressions with the union and difference operators. J. ACM, 27(4):633-655, 1980.
30. A. D. Sarma, M. Theobald, and J. Widom. Exploiting lineage for confidence computation in uncertain and probabilistic databases. In ICDE, 2008.
31. P. Senellart and S. Abiteboul. On the complexity of managing probabilistic XML data. In PODS, 2007.
32. O. Shmueli. Equivalence of datalog queries is undecidable. J. of Logic Programming, 15, 1993.
33. W.-C. Tan. Containment of relational queries with annotation propagation. In DBPL, September 2003.
34. E. Zimanyi. Query evaluation in probabilistic relational databases. TCS, 171(1-2), 1997.