Efficient computation of Iceberg cubes with complex measures

Author:

Han Jiawei1,Pei Jian1,Dong Guozhu2,Wang Ke1

Affiliation:

1. School of Computing Science, Simon Fraser University, B.C., Canada

2. Department of Computer Science, Wright State University, Dayton, OH

Abstract

It is often too expensive to compute and materialize a complete high-dimensional data cube. Computing an iceberg cube, which contains only aggregates above certain thresholds, is an effective way to derive nontrivial multi-dimensional aggregations for OLAP and data mining. In this paper, we study efficient methods for computing iceberg cubes with some popularly used complex measures, such as average , and develop a methodology that adopts a weaker but anti-monotonic condition for testing and pruning search space. In particular, for efficient computation of iceberg cubes with the average measure, we propose a top-k average pruning method and extend two previously studied methods, Apriori and BUC, to Top- k Apriori and Top- k BUC. To further improve the performance, an interesting hypertree structure, called H-tree, is designed and a new iceberg cubing method, called Top- k H-Cubing, is developed. Our performance study shows that Top- k BUC and Top- k H-Cubing are two promising candidates for scalable computation, and Top- k H-Cubing has better performance in most cases.

Publisher

Association for Computing Machinery (ACM)

Subject

Information Systems,Software

Reference16 articles.

1. S. Agarwal R. Agrawal P. M. Deshpande A. Gupta J. F. Naughton R. Ramakrishnan and S. Sarawagi. On the computation of multidimensional aggregates. VLDB'96. S. Agarwal R. Agrawal P. M. Deshpande A. Gupta J. F. Naughton R. Ramakrishnan and S. Sarawagi. On the computation of multidimensional aggregates. VLDB'96.

2. R. Agrawal and R. Srikant. Fast algorithms for mining association rules. VLDB'94. R. Agrawal and R. Srikant. Fast algorithms for mining association rules. VLDB'94.

3. Bottom-up computation of sparse and Iceberg CUBE

4. An overview of data warehousing and OLAP technology

Cited by 45 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Mining Interesting Aggregate Tuples;Lecture Notes in Networks and Systems;2024

2. Elucidating strategic patterns from target customers using multi-stage RFM analysis;Journal of Global Scholars of Marketing Science;2022-09-09

3. Enabling efficient and general subpopulation analytics in multidimensional data streams;Proceedings of the VLDB Endowment;2022-07

4. Timely Reporting of Heavy Hitters Using External Memory;ACM Transactions on Database Systems;2021-12-31

5. Big high-dimension data cube designs for hybrid memory systems;Knowledge and Information Systems;2020-08-26

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3