Abstract
A major problem of unstructured P2P systems is their heavy network traffic. This is caused mainly by high numbers of query answers, many of which are irrelevant for users. One solution to this problem is to use Top-k queries whereby the user can specify a limited number (k) of the most relevant answers. In this paper, we present FD, a (Fully Distributed) framework for executing Top-k queries in unstructured P2P systems, with the objective of reducing network traffic. FD consists of a family of algorithms that are simple but effective. FD is completely distributed, does not depend on the existence of certain peers, and addresses the volatility of peers during query execution. We validated FD through implementation over a 64-node cluster and simulation using the BRITE topology generator and SimJava. Our performance evaluation shows that FD can achieve major performance gains in terms of communication and response time.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
K. Aberer and J. Wu, “Framework for decentralized ranking in web information retrieval,” in Proc. of the 5th Asia Pacific Web Conference (APWeb), 2003.
K. Aberer et al., “P-Grid: A self-organizing structured P2P system,” SIGMOD Record, vol. 32, no. 3, 2003.
R. Akbarinia, V. Martins, E. Pacitti and P. Valduriez, “Design and implementation of Atlas P2P architecture,” Global Data Management, R. Baldoni, G. Cortese and F. Davide (Eds.), IOS Press, 2006.
R. Akbarinia and V. Martins, “Data management in the APPA P2P system,” Int. Workshop on High-Performance Data Management in Grid Environments (HPDGrid), 2006.
BRITE, http://www.cs.bu.edu/brite/.
M.J. Carey and D. Kossmann, On saying “Enough Already!,” SIGMOD Conf., 1997.
S. Chaudhuri and L. Gravano, “Evaluating Top-k selection queries,” VLDB Conf., 1999.
I. Clarke et al., “Protecting free expression online with freenet,” IEEE Internet Computing, vol. 6, no. 1, 2002.
F.M. Cuenca-Acuna, C. Peery, R.P. Martin, and T.D. Nguyen, “PlanetP: Using gossiping to build content addressable peer-to-peer information sharing communities,” IEEE Int. Symp. on High Performance Distributed Computing (HPDC), 2003.
R. Fagin, J. Lotem, and M. Naor, “Optimal aggregation algorithms for middleware,” J. Comput. Syst. Sci., vol. 66, no. 4, 2003.
Gnutella. http://www.gnutelliums.com/.
F. Howell and R. McNab, “SimJava: A discrete event simulation package for Java with applications in computer systems modeling,” Int. Conf. on Web-based Modelling and Simulation, Society for Computer Simulation, San Diego, CA, 1998.
Kazaa. http://www.kazaa.com/.
S. Michel, P. Triantafillou, and G. Weikum, “KLEE: A framework for distributed top-k query algorithms,” VLDB Conf., 2005.
B. Ooi, Y. Shu, and K.-L. Tan, “Relational data sharing in peer-based data management systems,” SIGMOD Record, vol. 32, no. 3, 2003.
S. Ratnasamy, P. Francis, M. Handley, R.M. Karp, and S. Shenker, “A scalable content-addressable network,” in Proc. of SIGCOMM, 2001.
M. Ripeanu and I. Foster, “Mapping the gnutella network: Macroscopic properties of large-scale peer-to-peer systems,” IPTPS, 2002.
M. Ripeanu, A. Iamnitchi, and I. Foster, “Mapping the Gnutella network,” IEEE Internet Computing, vol. 6, no. 1, 2002.
S. Saroiu, P. Gummadi, and S. Gribble, “A measurement study of peer-to-peer file sharing systems,” in Proc. of Multimedia Computing and Networking (MMCN), 2002.
I. Stoica, R. Morris, D.R. Karger, M.F. Kaashoek, and H. Balakrishnan, “Chord: A scalable peer-to-peer lookup service for internet applications,” in Proc. of SIGCOMM, 2001.
I. Tatarinov et al., “The Piazza peer data management project,” SIGMOD Record, vol. 32, no. 3, 2003.
U. Thaden, W. Siberski, W.T. Balke, and W. Nejdl, “Top-k query evaluation for schema-based peer-to-peer networks,” Int. Semantic Web Conf. (ISWC), 2004.
M. Theobald, G. Weikum, and R. Schenkel, “Top-k query evaluation with probabilistic guarantees,” VLDB Conf., 2004.
B. Yang and H. Garcia-Molina, “Improving search in peer-to-peer networks,” in Proc. Int. Conf. on Distributed Computing Systems (ICDCS), 2002.
C. Yu, G. Philip, and W. Meng, “Distributed Top-n query processing with possibly uncooperative local systems,” VLDB Conf., 2003.
C. Yu, P. Sharma, W. Meng, and Y. Qin, “Databases selection for processing k nearest neighbors queries in distributed environments,” ACM/IEEE-CS joint Conf. on DL, 2001.
Author information
Authors and Affiliations
Corresponding author
Additional information
Recommended by: Sunil Prabhakar
Work partially funded by the ARA Massive Data of the Agence Nationale de la Recherche.
Rights and permissions
About this article
Cite this article
Akbarinia, R., Pacitti, E. & Valduriez, P. Reducing network traffic in unstructured P2P systems using Top-k queries. Distrib Parallel Databases 19, 67–86 (2006). https://doi.org/10.1007/s10619-006-8313-5
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10619-006-8313-5