Querying peer-to-peer networks using P-trees

ACM International Conference Proceeding Series

Volumn 67, Issue , 2004, Pages 25-30

  Crainiceanu, Adina ^a   Linga, Prakash ^a   Gehrke, Johannes ^a   Shanmugasundaram, Jayavel ^a  

^a Department of Obstetrics Gynecology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FAULT-TOLERANT; INDEX STRUCTURE; PEER TO PEER; RANGE QUERY;

DISTRIBUTED COMPUTER SYSTEMS;

PEER TO PEER NETWORKS;

EID: 77954433598     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1017074.1017082     Document Type: Conference Paper

References (9)

1. K. Aberer. P-grid: A self-organizing access structure for p2p information systems. In CoopIS, 2001.
2. J. Aspnes and G. Shah. Skip graphs. In SODA, 2003.
3. D. Comer. The ubiquitous b-tree. In Computing Surveys, 11(2), 1979.
4. A. Daskos et al. Peper: A distributed range addressing space for p2p systems. In DBISP2P, 2003.
5. A. Gupta et al. Approximate range selection queries in peer-to-peer systems. In CIDR, 2003.
6. D. B. Lomet. Replicated indexes for distributed data. In PDIS, 1996.
7. S. Ratnasamy et al. A scalable content-addressable network. In SIGCOMM, 2001.
8. A. Rowstron and P. Druschel. Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In Middleware, 2001.
9. I. Stoica et al. Chord: A scalable peer-to-peer lookup service for internet applications. In SIGCOMM, 2001.