Equivalence of queries that are sensitive to multiplicities

VLDB Journal

Volumn 18, Issue 3, 2009, Pages 765-785

  Cohen, Sara ^a  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

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

Indexed keywords

BAG SEMANTICS; COMBINED SEMANTICS; DATALOG; QUERY EQUIVALENCE; SET SEMANTICS;

QUERY LANGUAGES; SEMANTICS; TRAJECTORIES;

EQUIVALENCE CLASSES;

EID: 67649565844     PISSN: 10668888     EISSN: 0949877X     Source Type: Journal    
DOI: 10.1007/s00778-008-0122-1     Document Type: Article

References (29)

1. A.V. Aho Y. Sagiv J.D. Ullman 1979 Efficient optimization of a class of relational expressions ACM Trans. Database Syst. 4 4 435 454 (Pubitemid 10433773)
2. Calvanese, D., Giacomo, G.D., Vardi, M.Y.: Decidable containment of recursive queries. In: Calvanese, D., et al. (eds.) In: Proceedings of the 9th International Conference on Database Theory, Siena, Italy, January 8-10, 2003, pp. 327-342
3. Chandra, A.K., Merlin, P.M.: Optimal implementation of conjunctive queries in relational data bases. In: STOC, pp. 77-90. ACM Press, New York (1977)
4. Chaudhuri, S.: An overview of query optimization in relational systems. In: PODS, pp. 34-43. ACM Press, New York (1998)
5. Chaudhuri, S., Vardi, M.Y.: Optimization of real conjunctive queries. In: PODS, pp. 59-70. ACM Press, New York (1993)
6. C. Chekuri A. Rajaraman 2000 Conjunctive query containment revisited Theor. Comput. Sci. 239 2 211 229
7. Cohen, S.: Equivalence of queries combining set and bag-set semantics. In: Vansummeren, S. (ed.) Proceedings of the Twenty- Fifth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 26-28, 2006, Chicago, Illinois, Maryland, USA, pp. 70-79 (Pubitemid 46946468)
8. Cohen, S., Nutt, W., Serebrenik, A.: Rewriting aggregate queries using views. In: PODS, pp. 155-166. ACM Press, New York (1999)
9. Cohen, S., Nutt, W., Sagiv, Y.: Containment of Aggregate Queries. In: Calvanese, D., et al. (eds.) Proceedings of the 9th International Conference on Database Theory, Siena, Italy, January 8-10, 2003, pp. 111-125
10. S. Cohen Y. Sagiv W. Nutt 2005 Equivalences among aggregate queries with negation ACM Trans. Comput. Log. 6 2 328 360 (Pubitemid 40479436)
11. Cohen, S., Nutt, W., Sagiv, Y.: Deciding equivalences among conjunctive aggregate queries. J. ACM 54(2), (2007)
12. Dayal, U.: Of nests and trees: a unified approach to processing queries that contain nested subqueries, aggregates, and quantifiers. In: Stocker, P.M., Kent, W., Hammersley, P. (eds.) VLDB, pp. 197-208. Morgan Kaufmann, San Francisco (1987)
13. A.Y. Halevy 2001 Answering queries using views: a survey VLDB J. 10 4 270 294 (Pubitemid 33570969)
14. A.Y. Halevy I.S. Mumick Y. Sagiv O. Shmueli 2001 Static analysis in datalog extensions J. ACM 48 5 971 1012
15. Y.E. Ioannidis R. Ramakrishnan 1995 Containment of conjunctive queries: beyond relations as sets ACM Trans. Database Syst. 20 3 288 324
16. Jayram, T.S., Kolaitis, P.G., Vee, E.: The containment problem for real conjunctive queries with inequalities. In: Vansummeren, S. (ed.) Proceedings of the Twenty-Fifth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 26-28, 2006, Chicago, Illinois, Maryland, USA, pp. 80-89 (Pubitemid 46946469)
17. D.S. Johnson A.C. Klug 1983 Optimizing conjunctive queries that contain untyped variables SIAM J. Comput. 12 4 616 640
18. Khizder V.L., Toman D., Weddell G.E.: Reasoning about duplicate elimination with description logic. In: Lloyd, J.W., Dahl, V., Furbach, U., Kerber, M., Lau, K.-K., Palamidessi, C., Pereira, L.M., Sagiv, Y., Stuckey, P.J. (eds.) Computational Logic. Lecture Notes in Computer Science, vol. 1861, pp. 1017-1032. Springer, Berlin (2000)
19. W. Kim 1982 On optimizing an SQL-like nested query ACM Trans. Database Syst. 7 3 443 469 (Pubitemid 13442393)
20. A.C. Klug 1988 On conjunctive queries containing inequalities J. ACM 35 1 146 160
21. Levy, A.C., Sagiv, Y.: Semantic query optimization in datalog programs. In: PODS, pp. 163-173. ACM Press, New York (1995)
22. Muralikrishna M.: Improved unnesting algorithms for join aggregate sql queries. In: Yuan, L.-Y. (ed) VLDB, pp. 91-102. Morgan Kaufmann, San Francisco (1992)
23. Paulley, G.N., Larson, P.-Å.: Exploiting uniqueness in query optimization. In: ICDE, pp. 68-79. IEEE Computer Society, USA (1994)
24. R. Pottinger A.Y. Halevy 2001 Minicon: a scalable algorithm for answering queries using views VLDB J. 10 2-3 182 198 (Pubitemid 33404197)
25. Y. Sagiv Y.P. Saraiya 1992 Minimizing restricted-fanout queries Discrete Appl. Math. 40 2 245 264
26. Y. Sagiv M. Yannakakis 1980 Equivalences among relational expressions with the union and difference operators J. ACM 27 4 633 655
27. Ullman J.D.: Principles of Database and Knowledge-Base Systems, vol. I. Computer Science Press, New York (1988)
28. Ullman J.D.: Principles of Database and Knowledge-Base Systems, vol. II. Computer Science Press, New York (1989)
29. R. van der Meyden 1997 The complexity of querying indefinite data about linearly ordered domains J. Comput. Syst. Sci. 54 1 113 135 (Pubitemid 127437200)