Processing Top-k Queries in Distributed Hash Tables - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2007

Processing Top-k Queries in Distributed Hash Tables

Résumé

Distributed Hash Tables (DHTs) provide a scalable solution for data sharing in large scale distributed systems, e.g. P2P systems. However, they only provide good support for exact-match queries, and it is hard to support complex queries such as top-k queries. In this paper, we propose a family of algorithms which deal with efficient processing of top-k queries in DHTs. We evaluated the performance of our solution through implementation over a 64-node cluster and simulation. Our performance evaluation shows very good performance, in terms of communication cost and response time.
Fichier non déposé

Dates et versions

inria-00378864 , version 1 (27-04-2009)

Identifiants

  • HAL Id : inria-00378864 , version 1

Citer

Reza Akbarinia, Esther Pacitti, Patrick Valduriez. Processing Top-k Queries in Distributed Hash Tables. International Euro-Par Conference, Aug 2007, Rennes, France. pp.489-502. ⟨inria-00378864⟩
318 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More