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

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

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