Exploiting early sorting and early partitioning for decision support query processing

VLDB Journal

Volumn 9, Issue 3, 2000, Pages 190-213

  Claussen, J ^a,b   Kemper, A ^a   Kossmann, D ^a,c   Wiesner, C ^a  

^a UNIVERSITY OF PASSAU   (Germany)

^b SAP RESEARCH   (Germany)

^c TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

Decision support systems; Early sorting and partitioning; Hash joins and hash teams; Performance evaluation; Query processing and optimization

Indexed keywords

EID: 0034366484     PISSN: 10668888     EISSN: None     Source Type: Journal    
DOI: 10.1007/s007780000030     Document Type: Article

References (33)

1. Braumandl R., Claussen J., Kemper A. Evaluating functional joins along nested reference sets in object-relational and object-oriented databases. In: Proc. of the Conf. on Very Large Data Bases (VLDB), New York, USA, August 1998, pp. 110-121
2. Braumandl R., Claussen J., Kemper A., Kossmann D. Functional join processing. The VLDB Journal 8(3-4): 156-177, 2000.
3. Bitton D., DeWitt D.J. Duplicate record elimination in large data files. ACM Trans. on Database Systems 8(2): 255-265, 1983
4. Bloom B. Space/time trade-offs in hash coding with allowable errors. Communications of the ACM 13: 422-426, 1970
5. Bratbergsengen K. Hashing methods and relational algebra operations. In: Proc. of the Conf. on Very Large Data Bases (VLDB), pp. 323-333, Singapore, Singapore, 1984
6. Chan C.-Y., Ioannidis Y. Bitmap index design and evaluation. In: Proc. of the ACM SIGMOD Conf. on Management of Data, pp. 355-366, Seattle, Wash., USA, June 1998
7. Carey M., Kossmann D. On saying "enough already!" in SQL. In: Proc. of the ACM SIGMOD Conf. on Management of Data, pp. 219-230, Tucson, Ariz., USA, May 1997
8. Chaudhuri S., Shim K. Including group-by in query optimization. In: Proc. of the Conf. on Very Large Data Bases (VLDB), pp. 354-366, Santiago, Chile, September 1994
9. Chaudhuri S., Shim K. Optimization of queries with user-defined predicates. In: Proc. of the Conf. on Very Large Data Bases (VLDB), pp. 87-98, Bombay, India, September 1996
10. Davison D.L., Graefe G. Memory-contention responsive hash joins. In: Proc. of the Conf. on Very Large Data Bases (VLDB), pp. 379-390, Santiago, Chile, September 1994
11. Graefe G., Bunker R., Cooper S. Hash joins and hash teams in Microsoft SQL Server. In: Proc. of the Conf. on Very Large Data Bases (VLDB), pp. 86-97, New York, USA, August 1998
12. Gray J., Bosworth A., Layman A., Pirahesh H. Data cube: A relational aggregation operator generalizing group-by, cross-tab, and sub-total. In: Proc. IEEE Conf. on Data Engineering, pp. 152-159, New Orleans, La., USA, February 1996
13. Graefe G., DeWitt D. The EXODUS optimizer generator. In: Proc. of the ACM SIGMOD Conf. on Management of Data, pp. 160-172, San Francisco, Calif., USA, May 1987
14. +97] Grust T., Krüger J., Gluche D., Heuer A., Scholl M.H. Query evaluation in CROQUE - calculus and algebra coincide. In: Proc. British National Conference on Databases (BNCOD), pp. 84-100, London, UK, July 1997
15. Graefe G., O'Neil P. Multi-table joins through bitmapped join indices. ACM SIGMOD Record 24(3): 8-11, Oct 1995
16. Graefe G. Query evaluation techniques for large databases. ACM Computing Surveys 25(2): 73-170, June 1993
17. Graefe G. Sort-Merge-Join: An idea whose time has(h) passed? In: Proc. IEEE Conf. on Data Engineering, pp. 406-417, Houston, Tex., USA, 1994
18. Haas L., Carey M., Livny M., Shukla A. Seeking the truth about ad hoc join costs. The VLDB Journal 6(3): 241-256, 1997
19. Helmer S., Westmann T., Moerkotte G. Diag-Join: An opportunistic join algorithm for 1:N relationships. In: Proc. of the Conf. on Very Large Data Bases (VLDB), pp. 98-109, New York, USA, August 1998
20. Kemper A., Kossmann D., Wiesner C. Generalized hash teams for join and group-by. In: Proc. of the Conf. on Very Large Data Bases (VLDB), pp. 30-41, Edinburgh, UK, September 1999
21. Kossmann D., Stocker K. Iterative dynamic programming: A new class of query optimization algorithms. ACM Trans, on Database Systems 25(1), March 2000, in press
22. Larson P.A. Grouping and duplicate elimination: Benefits of early aggregation. Microsoft Technical Report, January 1997. http://www.research.microsoft.com/ palarson/
23. Lohman G. Grammar-like functional rules for representing query optimization alternatives. In: Proc. of the ACM SIGMOD Conf. on Management of Data, pp. 18-27, Chicago, Ill., USA, May 1988
24. Li Z., Ross K.A. Fast joins using join indices. The VLDB Journal 8(1): 1-24, May 1999
25. Mishra P., Eich M. Join processing in relational databases. ACM Computing Surveys 24(1): 63-113, March 1992
26. Marek R., Rahm E. TID hash joins. In: International Conference on Information and Knowledge Management (CIKM), pp. 42-49, Gaithersburg, Md., USA, 1994
27. +79] Selinger P., Astrahan M., Chamberlin D., Lorie R., Price T. Access path selection in a relational database management system. In: Proc. of the ACM SIGMOD Conf. on Management of Data, pp. 23-34, Boston, USA, May 1979
28. Shapiro L. Join processing in database systems with large main memories. ACM Trans, on Database Systems 11(9): 239-264, September 1986
29. Simmen D., Shekita E., Malkemus T. Fundamental techniques for order optimization. In: Proc. of the ACM SIGMOD Conf. on Management of Data, pp. 57-67, Montreal, Canada, June 1996
30. Transaction Processing Performance Council TPC. TPC benchmarks H and R (decision support). Standard Specification, Transaction Processing Performance Council (TPC), October 1999. http://www.tpc.org/
31. Yan W., Larson P.A. Performing group-by before join. In: Proc. IEEE Conf. on Data Engineering, pp. 89-100, Houston, Tex., USA, 1994
32. Yan W.P., Larson RA. Eager aggregation and lazy aggregation. In: Proc. of the Conf. on Very Large Data Bases (VLDB), pp. 345-357, Zürich, Switzerland, September 1995
33. Zhao Y., Deshpande P., Naughton J., Shukla A. Simultaneous optimization and evaluation of multiple dimensional queries. In: Proc. of the ACM SIGMOD Conf. on Management of Data, pp. 271-282, Seattle, Wash., USA, June 1998