An efficient processing of queries with joins and aggregate functions in data warehousing environment

Jinho Kim, Y. Kim, Sang-Wook Kim, Sooho Ok
{"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.
数据仓库环境中使用连接和聚合函数高效处理查询
在数据仓库环境中,高效地处理昂贵的查询(包括连接和/或聚合函数)非常重要,因为存在大量数据,处理这些查询需要花费大量时间。本文提出了一种同时包含连接函数和聚合函数的查询处理新方法。该方法首先对具有group-by条件的维度表进行分组,然后使用位图连接索引进行连接。这允许我们只通过访问事实表来处理聚合函数,因此它可以减少现有方法的严重性能下降。为了证明所提方法的优越性,我们对所提方法和现有方法都建立了成本模型,并基于TPC-H基准进行了广泛的仿真。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信