ASAP Top-k Query Processing in Unstructured P2P Systems - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Conference Papers Year : 2010

ASAP Top-k Query Processing in Unstructured P2P Systems

Abstract

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 thèse 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 validated our solution through implementation and extensive experimentation. The results show that ASAP significantly outperforms baseline algorithms by returning final top-k result to users in much better times.
Fichier principal
Vignette du fichier
P2P_2010.pdf (577.51 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

lirmm-00607926 , version 1 (11-07-2011)

Licence

Attribution

Identifiers

  • HAL Id : lirmm-00607926 , version 1

Cite

William Kokou Dedzoe, Philippe Lamarre, Reza Akbarinia, Patrick Valduriez. ASAP Top-k Query Processing in Unstructured P2P Systems. IEEE Tenth International Conference on Peer-To-Peer Computing (P2P), Aug 2011, Kyoto, Netherlands. pp.1-10. ⟨lirmm-00607926⟩
475 View
1026 Download

Share

Gmail Facebook X LinkedIn More