Academic
Publications
ASAP Top-k Query Processing in Unstructured P2P Systems

ASAP Top-k Query Processing in Unstructured P2P Systems,10.1109/P2P.2010.5569974,William Kokou Dedzoe,Philippe Lamarre,Reza Akbarinia,Patrick Valdurie

ASAP Top-k Query Processing in Unstructured P2P Systems   (Citations: 1)
BibTex | RIS | RefWorks Download
Top-k query processing techniques are useful in unstructured peer-to-peer (P2P) systems, to avoid overwhelming users with too many results. However, existing approaches suffer from long waiting times. This is because top-k results are returned only when all queried peers have finished processing the query. As a result, query response time is dominated by the slowest queried peer. In this paper, we address this users' waiting time problem. For this, we revisit top-k query processing in P2P systems by introducing two novel notions in addition to response time: the stabilization time and the cumulative quality gap. Using these notions, we formally define the as-soon-as-possible (ASAP) top-k processing problem. Then, we propose a family of algorithms called ASAP to deal with this problem. We validate our solution through implementation and extensive experimentation. The results show that ASAP significantly outperforms baseline algorithms by re- turning final top-k result to users in much better times.
Conference: Peer-to-Peer Computing - P2P , pp. 1-10, 2010
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
    • ...Top-k query processing in Peer-to-Peer (P2P) systems has received a lot of attention [6,18,19,1,2]...
    • ...[1] and [6]) are not suitable for many popular P2P applications, such as P2P web search engines...
    • ...In classical query forwarding approaches [1,6], a peer forwards any incoming query to all its neighbors in parallel...
    • ...In current approaches [1,6], a peer executes incoming queries as they arrive, i.e...
    • ...In unstructured P2P systems, Fully Distributed (FD) [1] and As Soon As Possible (ASAP) [6] are baseline approaches for top-k processing over horizontally partitioned data stored on peers...
    • ...In [1], the authors present FD, a fully distributed approach for top-k query processing in unstructured P2P systems. Recently, FD was improved by ASAP [6]...

    William Kokou Dedzoeet al. Efficient Early Top k Query Processing in Overloaded P2P Systems

Sort by: