@MANUAL{Nejdl_04,
     TITLE       = {Top-k Query Evaluation for Schema-Based Peer-to-Peer Networks},
     AUTHOR      = {W. Nejdl and W. Siberski and U. Thaden and W.-T. Balke},
     YEAR        = {2004},
     ADDRESS     = {},
     EDITION     = {},
     MONTH       = {},
     ORGANIZATION= {},
     NOTE        = {},
     KEY         = {},
     KEYWORDS    = {},
     URL         = {http://www.kbs.uni-hannover.de/Arbeiten/Publikationen/2004/topk_iswc.pdf},
     ABSTRACT    = {Increasing the number of peers in a peer-to-peer network usually increases
the number of answers to a given query as well. While having more
answers is nice in principle, users are not interested in
arbitrarily large and unordered answer sets, but rather in a small
set of ĦħbestĦħ answers. Inspired by the success of ranking
algorithms in Web search engine and top-k query evaluation
algorithms in databases, we propose a decentralized top-k query
evaluation algorithm for peer-to-peer networks which makes use of
local rankings, rank merging and optimized routing based on peer
ranks, and minimizes both answer set size and network traffic
among peers. As our algorithm is based on dynamically collected
query statistics only, no continuous index update processes are
necessary, allowing it to scale easily to large numbers of
peers.},
}