科研之友
微信
新浪微博
Facebook
分享链接
摘要
Interests in distributed storage are fueled by demand for reliability and resilience combined with ubiquitous availability. The flooding approach favored by some P2P networks is inefficient in resource usage, but more scalable and resource-efficient solutions based on Distributed Hash Tables (DHT). DHT, as with a hash-table data structure, provides interfaces to store and lookup a key-value pair. DHT offers lookups with high result guarantee and short path length, even when looking for rare key-value pairs. Based on DHT a lookup request for a resource (with a key) is routed to the responsible node of the key. However, in many cases, a resource has several attributes, cannot use one key to lookup, we need a fast multi-attribute range queries. Recently, a number of approaches have been proposed to support multi-attribute range queries based on DHT. In this paper, we choose three typical example form three kind of approaches support multi-attribute range queries to comparative study.
- 出版日期2012-3-15
- 单位华南理工大学
