Querying peer-to-peer networks using P-trees

Proceedings of the 5th International Workshop on Exploratory Search in Databases and the Web. International Workshop on Exploratory Search in Databases and the Web (5th : 2018 : Houston, Tex.) Pub Date : 2004-06-17 DOI:10.1145/1017074.1017082

Adina Crainiceanu, Prakash Linga, J. Gehrke, J. Shanmugasundaram

引用次数: 175

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.

查看原文本刊更多论文

使用p树查询对等网络

我们提出了一种新的分布式、容错对等索引结构，称为p树。p树除了计算相等查询外，还有效地计算范围查询。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Proceedings of the 5th International Workshop on Exploratory Search in Databases and the Web. International Workshop on Exploratory Search in Databases and the Web (5th : 2018 : Houston, Tex.)

自引率

0.00%

发文量