An Efficient Algorithm Based on Covering Codes about Ranking the Results of Partial-Sum Queries
Zhang Wei-hua · Beijing Daxue Xuebao. Zirankexueban · 2007
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.