Paper Info
Title
An efficient processing of queries with joins and aggregate functions in data warehousing environment
Abstract
It is very important to process efficiently expensive queries including joins and/or aggregate functions in a data warehousing environment since there resides an enormous volume of data and the processing of these queries takes a lot of time. In this paper, we propose a new method for processing the queries including both joins and aggregate functions. The proposed method performs grouping of dimension tables with group-by conditions at first and then processes joins by using bitmap join indices. This allows us to process aggregate functions by accessing fact tables only, thus it can reduce the serious performance degradation of existing methods. In order to show the superiority of the proposed method, we develop a cost model for both the proposed and the existing ones, and perform extensive simulations based on the TPC-H benchmark.
Year
DOI
Venue
2002
10.1109/DEXA.2002.1045993
DEXA Workshops
Keywords
Field
DocType
dimension table grouping,aggregate function,tpc-h benchmark,aggregate functions,data warehouses,group-by conditions,enormous volume,fact tables,cost model,accessing fact table,dimension table,olap,data warehousing environment,bitmap join indices,simulations,joins,data mining,performance evaluation,new method,efficient processing,query processing,expensive query,data warehousing
Data warehouse,Data mining,Joins,Computer science,Bitmap,Database
Conference
ISSN
ISBN
Citations 
1529-4188
0-7695-1668-8
2
PageRank 
References 
Authors
0.37
7
4
Name
Order
Citations
PageRank
Jinho Kim1165.47
Yunho Kim236622.54
Sang-Wook Kim3792152.77
Soo-Ho Ok492.60