Browse > Article

Efficient Processin of Queries with Joints and Aggregate Functions in ROLAP Data Warehousing Environment  

Kim, Jin-Ho (Department of Computer Science Kangwon National University)
Kim, Yun-Ho (Department of Computer, Information, and Communications Engineering, Kangwon National University)
Kim, Sang-Wook (Department of Computer, Information, and Communications Engineering, Kangwon National University)
Publication Information
Abstract
Efficient processing of expensive queries that include joins and/or aggregate functions is crucial in data warehousing environment since there reside enormous volume of data. In this paper, we propose a new method for processing of queries that have both of joins and aggregate functions. The proposed method first performs grouping of the dimension table and then processes join by using the bitmap join index. This makes only the fact table accessed for processing aggregate functions, and thus resolves the serious performance degradation of the existing method. For showing the superiority of the proposed method, we suggest the cost models for the proposed and existing ones, and perform extensive simulations based on the TPC-H benchmark.
Keywords
Citations & Related Records
연도 인용수 순위
  • Reference
1 W.P. Yan and P.A. Larson, 'Eager Aggregation and Lazy Aggregation,' In Proc. Int'l Conf. on Very Large Data Bases, pp. 345-357, Zurich, Switzerland, September 1995
2 M.C. Wu, 'Query Optimization for Selections using Bitmaps,' In Proc. Int'l. Conf. on Minagement of Data, ACM SIGMOD, pp. 227-238, Philadephia, Pennsylvania, USA, June 1999
3 M.C. Wu and A. Buchmann, 'Encoded Bitmap Indexing for Data Warehouses,' In Proc. Int'l. Conf. on Data Engineering, IEEE, pp. 220-230, Orlando, Florida, USA, February 1998
4 P. O'Neil and D. Quass, 'Improved Query Performance with Variant Indexes,' In Proc. Int'l. Conf. on Management of Data, ACM SIGMOD, pp. 38-49, Tucson, Arizona, USA, May 1997   DOI
5 Transaction Processing Performance Council (TPC), TPC Benchmark H (Decision Support), Standard Specification Revision 1.2.1, 1999
6 Informix White Paper, Informix Decision Support Indexing for the Enterprise Data Warehouse, 1998
7 W.H. Inmon, Building the Data Warehouse, John Wiley & Sons, March 1996
8 R. Kimball, The Data Warehouse Toolkit, John Wiley & Sons, 1996
9 M. Muralikrishna, 'Improved Unnesting Algorithms for Join Aggregate SQL Queries,' In Proc. Int'l. Conf. on Very Large Data Bases, pp. 91-102, Vancouver, Canada, August 1992
10 A. Gupta, V. Harinarayan, and D. Quass, 'Aggregate-Query Processing in Data Warehousing Environments,' In Proc. Int'l. Conf. on Very Large Data Bases, pp. 358-369, Zurich, Switzerland, September 1995
11 Goetz Graefe, 'Query Evaluation Techniques for Large Databases,' ACM Computing Surveys, Vol. 25, No. 2, pp. 73-170, 1993   DOI   ScienceOn
12 W.H. Inmon and R.D. Hackathorn, Using the Data Warehouse, John Wiley & Sons, 1994
13 W.D. Frazer and C.K. Wong, 'Sorting by Natural Selection,' Communications of the ACM, Vol. 15, No. 10, pp. 910-913, October 1972   DOI   ScienceOn
14 S. Chaudhuri and K. Shim, 'Optimizing Queries with Aggregate Views,' In Proc. Int'l. Conf. on Extending Database Technology, pp. 167-182, Avignon, France, March 1996
15 C.Y. Chan and Y.E. Ioannidis, 'Bitmap Index Design and Evaluation,' In Proc. Int'l. Conf. on Management of Data, ACM SIGMOD, pp. 355-366, Seattle, Washington, USA, June 1998   DOI   ScienceOn