Equivalence of queries combining set and bag-set semantics

Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

Volumn , Issue , 2006, Pages 70-79

  Cohen, Sara ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Bag semantics; Combined semantics; Datalog; Query equivalence; Set semantics

Indexed keywords

DATABASE SYSTEMS; EQUIVALENCE CLASSES; PROBLEM SOLVING; SEMANTICS;

BAG SEMANTICS; COMBINED SEMANTICS; QUERY EQUIVALENCE; SET SEMANTICS; SQL QUERIES;

QUERY PROCESSING;

EID: 34250651743     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1142351.1142362     Document Type: Conference Paper

References (25)

1. A. Aho, Y. Sagiv, and J. Ullman. Efficient optimization of a class of relational expressions. ACM Transactions on Database Systems, 4(4):435-454, 1979.
2. D. Calvanese, G. De Giacomo, and M. Y. Vardi. Decidable containment of recursive queries. In Proc 9th International Conference on Database Theory, Lecture Notes in Computer Science, pages 330-345, Siena (Italy), Jan. 2003. Springer-Verlag.
3. A. Chandra and P. Merlin. Optimal implementation of conjunctive queries in relational databases. In Proc. 9th Annual ACM Symposium on Theory of Computing, 1977.
4. S. Chaudhuri and M. Vardi. Optimization of real conjunctive queries. In Proc. 12th Symposium on Principles of Database Systems, Washington (D.C., USA), May 1993. ACM Press.
5. C. Chekuri and A. Rajaraman. Conjunctive query containment revisited. Theoretical Computer Science, 239(2):211-229, 2000.
6. S. Cohen, W. Nutt, and Y. Sagiv. Containment of aggregate queries. In Proc 9th International Conference on Database Theory, Lecture Notes in Computer Science, Siena (Italy), Jan. 2003. Springer-Verlag.
7. S. Cohen, W. Nutt, and Y. Sagiv. Equivalences among aggregate queries with negation. A CM Transactions on Computational Logic, 6(2), 2005.
8. S. Cohen, W. Nutt, and A. Serebrenik. Rewriting aggregate queries using views. In C. Papadimitriou, editor, Proc. 18th Symposium on Principles of Database Systems, Philadelphia (Pennsylvania, USA), May 1999. ACM Press.
9. S. Cosmadakis and P. Kanellakis. Functional and inclusion dependencies: A graph theoretic approach. In Proc. 3rd Symposium on Principles of Database Systems, Waterloo (Ontario, Canada), Apr. 1984. ACM Press.
10. Y. Ioannidis and R. Ramakrishnan. Beyond relations as sets. ACM Transactions on Database Systems, 20(3):288-324, 1995.
11. T. S. Jayram, P. Kolaitis, and E. Vee. The containment problem for "real" conjunctive queries with inequalities. In Proc. 25th Symposium on Principles of Database Systems, Chicago (Illinois, USA), June 2006. ACM Press.
12. D. Johnson and A. Klug. Testing containment of conjunctive queries under functional and inclusion dependencies. In Proc. 1st Symposium on Principles of Database Systems, pages 164-169, Los Angeles (California, USA), Mar. 1982. ACM Press.
13. D. Johnson and A. Klug. Optimizing conjunctive queries that contain untyped variables. SIAM Journal on Computing, 12(4):616-640, 1983.
14. A. Klug. On conjunctive queries containing inequalities. J. ACM, 35(1):146-160, 1988.
15. A. Levy, I. S. Mumick, Y. Sagiv, and O. Shmueli. Equivalence, query-reachability, and satisfiability in datalog extensions. In Proc. 12th Symposium on Principles of Database Systems, pages 109-122, Washington (D.C., USA), May 1993. ACM Press.
16. A. Levy, I. S. Mumick, Y. Sagiv, and O. Shmueli. Static analysis in datalog extensions. J. ACM, 48(5):971-1012, 2001.
17. A. Levy and Y. Sagiv. Semantic query optimization in datalog programs. In Proc. 14th Symposium on Principles of Database Systems, pages 163-173, San Jose (California, USA), Proc. 14th Symposium on Principles of Database Systems 1995. ACM Press.
18. W. Nutt, Y. Sagiv, and S. Shurin. Deciding equivalences among aggregate queries. In J. Paredaens, editor, Proc. 17th Symposium on Principles of Database Systems, pages 214-223, Seattle (Washington, USA), June 1998. ACM Press. Long version as Report of Esprit LTR DWQ.
19. Y. Sagiv and Y. Saraiya. Minimizing restricted-fanout queries. Discrete Applied Mathematics, 40:245-264, 1992.
20. Y. Sagiv and M. Yannakakis. Equivalence among relational expressions with the union and difference operators. J. ACM, 27(4):633-655, 1981.
21. E. Sciore. Inclusion dependencies and the universal instance. In Proc. 2nd Symposium on Principles of Database Systems, Atlanta (Georgia, USA), Mar. 1983. ACM Press.
22. J. D. Ullman. Principles of Database and Knowledge-Base Systems, volume II. Computer Science Press, 1988.
23. R. van der Meyden. The complexity of querying indefinite data about linearly ordered domains. In Proc. 11th Symposium on Principles of Database Systems, pages 331-345, San Diego (California, USA), May 1992. ACM Press.
24. F. Wei and G. Lausen. Conjunctive query containment in the presence of disjunctive integrity constraints. In Proceedings of the 9th International Workshop on Knowledge Representation meets Databases, Toulouse (France), Apr. 2002.
25. X. Zhang and Z. Ozsoyoglu. Implication and referential constraints: A new formal reasoning. IEEE 'Iransactions on Knowledge and Data Engineering, 9(6):894-910, 1997.