Top-k Query Processing in the APPA P2P System

Abstract : Top-k queries are attractive for users in P2P systems with very large numbers of peers but difficult to support efficiently. In this paper, we propose a fully distributed algorithm for executing Top-k queries in the context of the APPA (Atlas Peer-to-Peer Architecture) data management system. APPA has a network-independent architecture that can be implemented over various P2P networks. Our algorithm requires no global information, does not depend on the existence of certain peers and its bandwidth cost is low. We validated our algorithm through implementation over a 64-node cluster and simulation using the BRITE topology generator and SimJava. Our performance evaluation shows that our algorithm has logarithmic scale up and improves Top-k query response time very well using P2P parallelism in comparison with baseline algorithms.
Type de document :
Communication dans un congrès
Int. Conf. on High Performance Computing for Computational Science (VecPar), Jul 2006, Rio de Janeiro, Brazil. Springer, 4395, 2006, LNCS
Liste complète des métadonnées

https://hal.inria.fr/inria-00482362
Contributeur : Reza Akbarinia <>
Soumis le : lundi 10 mai 2010 - 12:03:15
Dernière modification le : jeudi 24 mai 2018 - 15:59:21

Identifiants

  • HAL Id : inria-00482362, version 1

Citation

Reza Akbarinia, Vidal Martins, Esther Pacitti, Patrick Valduriez. Top-k Query Processing in the APPA P2P System. Int. Conf. on High Performance Computing for Computational Science (VecPar), Jul 2006, Rio de Janeiro, Brazil. Springer, 4395, 2006, LNCS. 〈inria-00482362〉

Partager

Métriques

Consultations de la notice

440