Abstract
Top-k queries are very popular nowadays. In the distributed environment, the transfer of data
often is the bottleneck. To effectively answer a top-k queries, it is necessary to reduce the
number of accesses of data.
We have proposed a method called Lattice-based Rank Aggregation (LARA) to solve the top-k
queries with less accesses than other known methods. It is a two-phase algorithm. It has a
growing phase and a shrinking phase, and employs a lattice as data structure to handle the
process.
In this talk, LARA will be introduced. Background and related works of the problem will be
presented. Some preliminary experimental results will be reported as well.
