Querying Peer-to-Peer Networks Using P-Trees

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.

• Type: Conference
• Year: 2004
• Where: WEBDB
• Authors: Adina Crainiceanu, Prakash Linga, Johannes Gehrke, Jayavel Shanmugasundaram
• Keywords: Equality Queries, Fault-tolerant Peer-to-peer Index, Internet Technology, Range Queries, WEBDB 2004