Unnesting scalar SQL queries in the presence of disjunction

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2007, Pages 46-55

  Brantner, Matthias ^a   May, Norman ^a   Moerkotte, Guido ^a  

^a UNIVERSITY OF MANNHEIM   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; CORRELATION METHODS; MATHEMATICAL OPERATORS; OPTIMIZATION; PROBLEM SOLVING; TRANSLATION (LANGUAGES);

ALGEBRAIC EXPRESSIONS; BYPASS OPERATORS; SQL; UNNESTING STRATEGY;

QUERY PROCESSING;

EID: 34548712910     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2007.367850     Document Type: Conference Paper

References (29)

1. M. Brantner, S. Helmer, C.-C. Kanne, and G. Moerkotte. Kappa-join: Efficient execution of existential quantification in XML query languages. In Proceedings of the XML Database Symposium, Seoul, Korea, pages 1-15, 2006.
2. M. Brantner, N. May, and G. Moerkotte. Unnesting SQL queries in the presence of disjunction. Technical report, University of Mannheim, March 2006. http://pi3.informatik.uni-mannheim.de/publications/TR-06-013.pdf.
3. F. Bry. Towards an efficient evaluation of general queries: quantifier and disjunction processing revisited. In Proceedings of ACM SlGMOD Conference, Oregon, USA, pages 193-204, 1989.
4. B. Cao and A. Badia. A nested relational approach to processing SQL subqueries. In Proceedings of ACM SIGMOD Conference, Baltimore, USA, pages 191-202, 2005.
5. S. Cluet and G. Moerkotte. Classification and optimization of nested queries in object bases. Technical Report 95-6, RWTH Aachen, 1995.
6. S. Cluet and G. Moerkotte. Efficient evaluation of aggregates on bulk types. In Proceedings of 5th DBPL, Gubbio, Umbria, Italy, 1995.
7. C. J. Date. The outer join. In Proceedings of ICOD, Cambridge, England, pages 76-106, 1983.
8. U. Dayal. of nests and trees: A unified approach to processing queries that contain nested subqueries, aggregates, and quantifiers. In Proceedings of the VLDB Conference, Brighton, England, pages 197-208, 1987.
9. L. Fegaras. Query unnesting in object-oriented databases. In Proceedings ACM SIGMOD Conference, Seattle, USA, pages 49-60, 1998.
10. T. Fiebig, S. Helmer, C.-C. Kanne, G. Moerkotte, J. Neumann, R. Schiele, and T. Westmann. Anatomy of a native XML base management system. VLDB J., 11(4):292-314, 2002.
11. C. Galindo-Legaria and M. Joshi. Orthogonal optimization of subqueries and aggregation. In Proceedings of ACM SIGMOD Conference, Santa Barbara, USA, pages 571-581, 2001.
12. R. A. Ganski and H. K. T. Wong. Optimization of nested SQL queries revisited. In Proceedings of the ACM SIGMOD, San Francisco, USA, pages 23-33, 1987.
13. H. Garcia-Molina, J. D. Ullman, and J. Widom. Database Systems: The Complete Book. Prentice Hall, 2002. 0-13-098043-9.
14. G. Graefe. Executing nested queries. In BTW 2003, Datenbanksysteme für Business, Technologie und Web, Leipzig, Germany, pages 58-77, 2003.
15. R. Guravannavar, H. S. Ramanujam, and S. Sudarshan. Optimizing nested queries with parameter sort orders. In Proceedings of the VLDB Conference, Trondheim, Norway, pages 481-492, 2005.
16. M. Jarke and J. Koch. Query optimization in database systems. ACM Computing Surveys, 16(2): 111-152, June 1984.
17. A. Kemper, G. Moerkotte, K. Peithner, and M. Steinbrunn. Optimizing disjunctive queries with expensive predicates. Proceedings of ACM SIGMOD Conference, Minneapolis, USA, 23(2):336-347, June 1994.
18. W. Kiessling. SQL-like and Quel-like correlation queries with aggregates revisited. ERL/UCB Memo 84/75, University of Berkeley, 1984.
19. W. Kim. On optimizing an SQL-like nested query. ACM Transactions on Database Systems, 7(3):443-469, September 1982.
20. N. May, S. Helmer, and G. Moerkotte. Nested queries and quantifiers in an ordered context. In Proceedings of the ICDE Conference, Boston, USA, pages 239-250, 2004.
21. N. May and G. Moerkotte. Main memory implementations for binary grouping. In Proceedings of the XML Database Symposium, Trondheim, Norway, pages 162-176, 2005.
22. M. Muralikrishna. Improved unnesting algorithms for join aggregate sql queries. In Proceedings of VLDB Conference, Vancouver, Canada, pages 91-102, 1992.
23. T. Neumann. Efficient Generation and Execution of DAGStructured Query Graphs. PhD thesis, University of Mannheim., Germany, 2005.
24. P. Roy. Optimization of DAG-structured query evaluation plans. Master's thesis, Indian Institute of Technology, Bombay, 1998.
25. P. Seshadri, H. Pirahesh, and T. Y. C. Leung. Complex query decorrelation. In Proceedings of the ICDE Conference, New Orleans, USA, pages 450-458, 1996.
26. J. R. Slagle. An efficient algorithm for finding certain minimum-cost procedures for making binary decisions. J. ACM, 11(3):253-264, 1964.
27. H. J. Steenhagen. Optimization of Object Query Languages. PhD thesis, Department of Computer Science, University of Twente, 1995.
28. H. J. Steenhagen, P. M. G. Apers, H. M. Blanken, and R. A. de By. From nested-loop to join queries in OODB. In Proceedings of the VLDB Conference, Santiago de Chile, Chile, pages 618-629, 1994.
29. TPC TPC benchmark H (decision support). Standard Specification Version 2.3.0, Transaction Processing Performance Council, 2006. http://www.tpc.org/.