P Tree: A P2P index for resource discovery applications

Proceedings of the 13th International World Wide Web Conference on Alternate Track, Papers and Posters, WWW Alt. 2004

Volumn , Issue , 2004, Pages 390-391

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

^a Department of Molecular Biology and Genetics   (United States)

Author keywords

Indexing; Peer To peer; Range queries; Resource discovery

Indexed keywords

EID: 57249087138     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1013367.1013490     Document Type: Conference Paper

References (10)

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. Crainiceanu et al. Querying peer-To-peer networks using p-Trees. In Cornell University TR 2004-1926, 2004.
5. A. Daskos et al. Peper: A distributed range addressing space for p2p systems. In DBISP2P, 2003.
6. A. Gupta et al. Approximate range selection queries in peer-To-peer systems. In CIDR, 2003.
7. D. B. Lomet. Replicated indexes for distributed data. In PDIS, 1996.
8. S. Ratnasamy et al. A scalable content-Addressable network. In SIGCOMM, 2001.
9. A. Rowstron and P. Druschel. Pastry: Scalable, decentralized object location, and routing for large-scale peer-To-peer systems. In Middleware, 2001.
10. I. Stoica et al. Chord: A scalable peer-To-peer lookup service for internet applications. In SIGCOMM, 2001.