基于覆盖码预排序的数据立方体部分和top-k查询算法

北京大学学报（自然科学版）

基于覆盖码预排序的数据立方体部分和top-k查询算法

张卫华¹,谭少华,殷普杰,张煜宇,成富

收稿日期:2005-12-30 出版日期:2007-01-20 发布日期:2007-01-20

An Efficient Algorithm Based on Covering Codes about Ranking the Results of Partial-Sum Queries

ZHANG Weihua¹, TAN Shaohua, YIN Pujie, ZHANG Yuyu, CHENG Fu

Received:2005-12-30 Online:2007-01-20 Published:2007-01-20

摘要/Abstract

摘要： 在决策支持系统中，排序查询是研究的热点问题。提出了一种在OLAP(数据仓库)数据立方体中对部分和查询结果进行排序的高效算法，该算法综合利用覆盖码和预排序，有效地解决了对部分和结果的top-k查询问题。实验结果表明无论数据在随机分布还是存在主导集情况下，该算法都能很好地改进查询的时间代价。

关键词: 联机分析处理, 部分和, top-k, 覆盖码

Abstract: In decision-support systems, ranking-aware queries have been gaining much attention recently. An efficient algorithm is introduced, which, by incorporating covering codes and pre-sorting, can effectively resolve the top-k queries over partial-sum results. This algorithm is empirically evaluated and the experimental results show that the query cost is improved significantly.

Key words: OLAP, partial-sum, top-k, covering codes

中图分类号:

TP311.13

张卫华,谭少华,殷普杰,张煜宇,成富. 基于覆盖码预排序的数据立方体部分和top-k查询算法[J]. 北京大学学报（自然科学版）.

ZHANG Weihua,TAN Shaohua,YIN Pujie,ZHANG Yuyu,CHENG Fu. An Efficient Algorithm Based on Covering Codes about Ranking the Results of Partial-Sum Queries[J]. Acta Scientiarum Naturalium Universitatis Pekinensis.

导出引用管理器 EndNote|Ris|BibTeX

链接本文: https://xbna.pku.edu.cn/CN/

https://xbna.pku.edu.cn/CN/Y2007/V43/I1/55