ACM Home Page
Please provide us with feedback. Feedback
Querying peer-to-peer networks using P-trees
Full text PdfPdf (218 KB)
Source WebDB; Vol. 67 archive
Proceedings of the 7th International Workshop on the Web and Databases: colocated with ACM SIGMOD/PODS 2004 table of contents
Paris, France
SESSION: Paper session 2: peer-to-peer search systems table of contents
Pages: 25 - 30  
Year of Publication: 2004
Authors
Adina Crainiceanu  Cornell University
Prakash Linga  Cornell University
Johannes Gehrke  Cornell University
Jayavel Shanmugasundaram  Cornell University
Sponsor
: INRIA
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 45,   Citation Count: 28
Additional Information:

abstract   references   cited by   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1017074.1017082
What is a DOI?

ABSTRACT

We propose a new distributed, fault-tolerant peer-to-peer index structure called the <B>P-tree</B>. P-trees efficiently evaluate range queries in addition to equality queries.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
3
 
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
7
 
8
9

CITED BY  28
Collaborative Colleagues:
Adina Crainiceanu: colleagues
Prakash Linga: colleagues
Johannes Gehrke: colleagues
Jayavel Shanmugasundaram: colleagues