Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Complex Queries in DHT-based Peer-to-Peer Networks
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
eXist: An Open Source Native XML Database
Revised Papers from the NODe 2002 Web and Database-Related Workshops on Web, Web-Services, and Database Systems
INS/Twine: A Scalable Peer-to-Peer Architecture for Intentional Resource Discovery
Pervasive '02 Proceedings of the First International Conference on Pervasive Computing
Peer-to-peer information retrieval using self-organizing semantic overlay networks
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
A Peer-to-peer Framework for Caching Range Queries
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Remindin': semantic query routing in peer-to-peer networks based on social metaphors
Proceedings of the 13th international conference on World Wide Web
Mercury: supporting scalable multi-attribute range queries
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Range Queries in Trie-Structured Overlays
P2P '05 Proceedings of the Fifth IEEE International Conference on Peer-to-Peer Computing
SIPPER: Selecting Informative Peers in Structured P2P Environment for Content-Based Retrieval
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
M-Chord: a scalable distributed similarity search structure
InfoScale '06 Proceedings of the 1st international conference on Scalable information systems
Risk Driven Semantic P2P Service Retrieval
P2P '06 Proceedings of the Sixth IEEE International Conference on Peer-to-Peer Computing
Scalable Blind Search and Broadcasting in Peer-to-Peer Networks
P2P '06 Proceedings of the Sixth IEEE International Conference on Peer-to-Peer Computing
Reinforcement Learning for Query-Oriented Routing Indices in Unstructured Peer-to-Peer Networks
P2P '06 Proceedings of the Sixth IEEE International Conference on Peer-to-Peer Computing
P-ring: an efficient and robust P2P range index structure
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Hybrid global-local indexing for effcient peer-to-peer information retrieval
NSDI'04 Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1
Querying the internet with PIER
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Scalability Support for SMI-S with Chord
HPCC '08 Proceedings of the 2008 10th IEEE International Conference on High Performance Computing and Communications
Replication, load balancing and efficient range query processing in DHTs
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
| Hi-index | 0.00 |
Range query in Peer-to-Peer networks based on Distributed Hash Table (DHT) is still an open problem. The traditional way uses order-preserving hashing functions to create value indexes that are placed and stored on the corresponding peers to support range query. The way, however, suffers from high index maintenance costs. To avoid the issue, a scalable blind search method over DHTs - recursive partition search (RPS) can be used. But, RPS still easily incurs high network overhead as network size grows. Thus, in this paper, a learning-aware RPS (LARPS) is proposed to overcome the disadvantages of two approaches above mentioned. Extensive experiments show LARPS is a scalable and robust approach for range query, especially in the following cases: a) query range is wide, b) the requested resources follow Zipf distribution, and c) the number of required resources is small.