Querying Peer-to-Peer Networks Using P-Trees Adina Crainiceanu, Prakash Linga, Johannes Gehrke, and Jayavel Shanmugasundaram   View Paper (PDF)   Return to Session 2: Peer-to-Peer Search Systems Abstract We propose a new distributed, fault-tolerant peer-to-peer index structure called the P-tree. P-trees efficiently evaluate range queries in addition to equality queries. BIBTEX @inproceedings {DBLP:conf/webdb/CrainiceanuLGS04,    author    = {Adina Crainiceanu and Prakash Linga and Johannes Gehrke and Jayavel Shanmugasundaram},    title     = {Querying Peer-to-Peer Networks Using P-Trees},    pages     = {25-30},    ee        = {http://webdb2004.cs.columbia.edu/papers/2-2.pdf},    booktitle = {Seventh International Workshop on the Web and Databases},    month     = Jun,    year      = 2004,    crossref  = {conf/webdb/2004}   } ©2005 Association for Computing Machinery