Querying peer-to-peer networks using P-trees

Adina Crainiceanu,Prakash Linga,Johannes Gehrke,Jayavel Shanmugasundaram

WebDB '04: Proceedings of the 7th International Workshop on the Web and Databases: colocated with ACM SIGMOD/PODS 2004（2004）

引用 213|浏览0

暂无评分

摘要

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.

查看译文

关键词

range query,peer-to-peer network,fault-tolerant peer-to-peer index structure,equality query,fault tolerant

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要