{"title":"An efficient processing of queries with joins and aggregate functions in data warehousing environment","authors":"Jinho Kim, Y. Kim, Sang-Wook Kim, Sooho Ok","doi":"10.1109/DEXA.2002.1045993","DOIUrl":null,"url":null,"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.","PeriodicalId":254550,"journal":{"name":"Proceedings. 13th International Workshop on Database and Expert Systems Applications","volume":"79 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. 13th International Workshop on Database and Expert Systems Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DEXA.2002.1045993","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
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.