P-tree: a p2p index for resource discovery applications

Adina Crainiceanu, Prakash Linga, J. Gehrke, J. Shanmugasundaram
{"title":"P-tree: a p2p index for resource discovery applications","authors":"Adina Crainiceanu, Prakash Linga, J. Gehrke, J. Shanmugasundaram","doi":"10.1145/1013367.1013490","DOIUrl":null,"url":null,"abstract":"We propose a new distributed, fault-tolerant Peer-to-Peer index structure for resource discovery applications called the P-tree. P-trees efficiently support range queries in addition to equality queries.","PeriodicalId":409891,"journal":{"name":"WWW Alt. '04","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"44","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"WWW Alt. '04","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1013367.1013490","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 44

Abstract

We propose a new distributed, fault-tolerant Peer-to-Peer index structure for resource discovery applications called the P-tree. P-trees efficiently support range queries in addition to equality queries.
P-tree:用于资源发现应用的p2p索引
我们为资源发现应用程序提出了一种新的分布式、容错对等索引结构,称为p树。除了等式查询外,p树还有效地支持范围查询。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信