SOLVING TOP-K QUERIES BY AGGREGATION IN LARGE SYSTEMS

摘要

The solving of the Top-k queries is an important and a difficult problem in the large scale systems. Aggregation is the best way for resolving this type of queries. It reduces substantially the amounts of exchanged data and optimizes the searching task. In this paper, we present a new algorithm with the aim of resolving this type of problems efficiently. Our algorithm runs across three phases and defines only one threshold, unlike the other existing algorithms. The simulations on real datasets and the comparison with some other algorithms show that our solution is very competitive.