Processing Top-k Queries in Distributed Hash Tables

Abstract : 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.
Type de document :
Communication dans un congrès
International Euro-Par Conference, Aug 2007, Rennes, France. Springer, 4641, pp.489-502, 2007, Lecture Notes in Computer Science
Liste complète des métadonnées

https://hal.inria.fr/inria-00378864
Contributeur : Reza Akbarinia <>
Soumis le : lundi 27 avril 2009 - 11:10:58
Dernière modification le : mercredi 11 avril 2018 - 01:56:54

Identifiants

  • HAL Id : inria-00378864, version 1

Collections

Citation

Reza Akbarinia, Esther Pacitti, Patrick Valduriez. Processing Top-k Queries in Distributed Hash Tables. International Euro-Par Conference, Aug 2007, Rennes, France. Springer, 4641, pp.489-502, 2007, Lecture Notes in Computer Science. 〈inria-00378864〉

Partager

Métriques

Consultations de la notice

489