skip to main content
10.1145/1013367.1013489acmconferencesArticle/Chapter ViewAbstractPublication PagesthewebconfConference Proceedingsconference-collections
Article

A storage and indexing framework for p2p systems

Published: 19 May 2004 Publication History

Abstract

We present a modularized storage and indexing framework that cleanly separates the functional components of a P2P system, enabling us to tailor the P2P infrastructure to the specific needs of various Internet applications eat, without having to devise completely new storage management and index structures for each application.

References

[1]
J. Aspnes and G. Shah. Skip graphs. In SODA, 2003.
[2]
F. Dabek et al. Wide-area cooperative storage with CFS. In SOSP, 2001.
[3]
A. Daskos et al. Peper: A distributed range addressing space for p2p systems. In DBISP2P, 2003.
[4]
P. Druschel et al. PAST: A large-scale, persistent peer-to-peer storage utility. In HotOS VIII, 2001.
[5]
S. Ratnasamy et al. A scalable content-addressable network. In SIGCOMM, 2001.
[6]
A. Rowstron et al. Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In Middleware, 2001.
[7]
I. Stoica et al. Chord: A scalable peer-to-peer lookup service for internet applications. In SIGCOMM, 2001.

Cited By

View all
  • (2005)Guaranteeing correctness and availability in P2P range indicesProceedings of the 2005 ACM SIGMOD international conference on Management of data10.1145/1066157.1066195(323-334)Online publication date: 14-Jun-2005

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
WWW Alt. '04: Proceedings of the 13th international World Wide Web conference on Alternate track papers & posters
May 2004
532 pages
ISBN:1581139128
DOI:10.1145/1013367
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 19 May 2004

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. indexing framework
  2. p2p
  3. peer-to-peer

Qualifiers

  • Article

Conference

WWW04
Sponsor:

Acceptance Rates

Overall Acceptance Rate 1,899 of 8,196 submissions, 23%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 19 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2005)Guaranteeing correctness and availability in P2P range indicesProceedings of the 2005 ACM SIGMOD international conference on Management of data10.1145/1066157.1066195(323-334)Online publication date: 14-Jun-2005

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media