A Peer-to-peer Framework for Caching Range Queries一个对等缓存范围查询点的框架.pptVIP

下载本文档

2
0
约1.12万字
约 32页
2018-06-24 发布于四川
举报
版权申诉

A Peer-to-peer Framework for Caching Range Queries一个对等缓存范围查询点的框架.ppt

1、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。。
2、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
4、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
5、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
6、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
7、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

A Peer-to-peer Framework for Caching Range Queries一个对等缓存范围查询点的框架

A Peer-to-peer Framework for Caching Range Queries Ozgur D. Sahin Abhishek Gupta Divyakant Agrawal Amr El Abbadi Outline Motivation Range mapping System overview Experimental results Conclusion and future work Motivation Motivation P2P Systems File sharing: Napster, Gnutella, KaZaA, … Central index or flooding Structured P2P systems: CAN, Chord, Pastry, Tapestry, … DHT/DOLR Efficient Routing: logarithmic/sublinear CAN Uses a d-dimensional virtual space for routing and object location Virtual space is partitioned into zones and each zone is maintained by a peer Every peer is responsible for the objects that are hashed into its zone Extending DHT functionality DHTs are designed for exact-match queries Piazza [Univ. of Washington], Hyperion [Univ. of Toronto], PIER [UC Berkeley] Extend DHTs for supporting range queries Selection of ranges is a primary operation for any kind of data analysis Main Goal: Utilize a DHT in order to materialize and locate cached answers of range queries Range Queries Given a range query, find the cached answers that can be used to compute the query answer Example: If the result of 20,35 is already cached in the system, then the query 22,30 can be answered using the cached result 22,30 is subsumed by 20,35; so the cached result is the super-set of the answer DHTs for locating ranges Can we use original DHTs? Extending CAN For single attribute, the virtual space is a 2-dimensional CAN The boundaries are determined by the domain of the range attribute Mapping Scheme Range x,y is mapped to point (x,y) Space Partitioning Virtual space is partitioned into rectangular zones Each zone is assigned to an active peer With this mapping, the data source is responsible for the top-left zone Space Partitioning Space Partitioning Space Partitioning Space Partitioning Each active peer keeps a list of passive peers Passive peers register with active peers Zone Split An active peer splits its zone when it is overloaded Load can be due to storage or band