使用p树查询对等网络

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

{"title":"使用p树查询对等网络","authors":"Adina Crainiceanu, Prakash Linga, J. Gehrke, J. Shanmugasundaram","doi":"10.1145/1017074.1017082","DOIUrl":null,"url":null,"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.","PeriodicalId":93360,"journal":{"name":"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.)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2004-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"175","resultStr":"{\"title\":\"Querying peer-to-peer networks using P-trees\",\"authors\":\"Adina Crainiceanu, Prakash Linga, J. Gehrke, J. Shanmugasundaram\",\"doi\":\"10.1145/1017074.1017082\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":93360,\"journal\":{\"name\":\"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.)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-06-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"175\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"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.)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/1017074.1017082\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"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.)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1017074.1017082","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 175

摘要

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

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

查看原文本刊更多论文

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

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%

发文量