P-Grid: A Self-Organizing Access Structure for P2P Information Systems

  • Karl Aberer
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2172)


Peer-To-Peer systems are driving a major paradigm shift in the era of genuinely distributed computing. Gnutella is a good example of a Peer-To-Peer success story: a rather simple software enables Internet users to freely exchange files, such as MP3 music files. But it shows up also some of the limitations of current P2P information systems with respect to their ability to manage data efficiently. In this paper we introduce P-Grid, a scalable access structure that is specifically designed for Peer-To-Peer information systems. P-Grids are constructed and maintained by using randomized algorithms strictly based on local interactions, provide reliable data access even with unreliable peers, and scale gracefully both in storage and communication cost.


Peer-To-Peer computing Distributed Indexing Distributed Databases Randomized Algorithms 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    E. Adar and B. A. Huberman: Free riding on Gnutella Technical report, Xerox PARC, 10 Aug. 2000. 179Google Scholar
  2. 2.
    D. Clark. Face-to-Face with Peer-to-Peer Networking. IEEE Computer, January 2001. 179Google Scholar
  3. 3.
    Y. Chen, K. Aberer: Combining Pat-Trees and Signature Files for Query Evaluation in Document Databases DEXA 99, LNCS, Vol. 1677, p. 473–484, Springer, 1999. 193Google Scholar
  4. 4.
    D. F. Ferguson, C. Nikolaou and Y. Yemini An Economy for Managing Replicated Data in Autonomous Decentralized Systems International Symposium on Autonomous Decentralized Systems (ISADS’93), 1993. 193Google Scholar
  5. 5.
    T. Johnson, P. Krishna Lazy Updates for Distributed Search Structure ACM SIGMOD 93, p. 337–346, 1993. 180CrossRefGoogle Scholar
  6. 6.
    B. Kröll, P. Widmayer Distributing a Search Tree Among a Growing Number of Processors. ACM SIGMOD 94, p. 265–276, 1994. 180CrossRefGoogle Scholar
  7. 7.
    B. Kröll, P. Widmayer Balanced Distributed Search Trees Do Not Exist WADS 95, p 50–61, 1995. 180Google Scholar
  8. 8.
    W. Litwin, M. Neimat, D. A. Schneider RP*: A Family of Order Preserving Scalable Distributed Data Structures. VLDB 94, p. 342–353, 1994. 180Google Scholar
  9. 9.
    M. Stonebraker, P. M. Aoki, W. Litwin, A. Pfeffer, A. Sah, Jeff Sidell, Carl Staelin, Andrew Yu: Mariposa A Wide-Area Distributed Database System VLDB Journal 5(1): 48–63, 1996. 193CrossRefGoogle Scholar
  10. 10.
    R. Vingralek, Y. Breitbart, G. Weikum SNOWBALL: Scalable Storage on Networks of Workstations with Balanced Load Distributed and Parallel Databases Vol 6(2), Kluwer Academic Publishers, 1998. 180Google Scholar
  11. 11.
    H. Yokota, Y. Kanemasa, J. Miyazaki Fat-Btree: An Update-Conscious Parallel Directory Structure ICDE 99, p. 448–457, 1999. 180Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Karl Aberer
    • 1
  1. 1.Distributed Information Systems Laboratory, Department of Communication SystemsSwiss Federal Institute of Technology (EPFL)LausanneSwitzerland

Personalised recommendations