ISSN 1002-1027  CN 11-2952/G2

Acta scientiarum naturalium Universitatis Pekinensis

Previous Articles     Next Articles

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

ZHANG Weihua1, TAN Shaohua, YIN Pujie, ZHANG Yuyu, CHENG Fu   

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

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.