Skip lists: a probabilistic alternative to balanced trees
Communications of the ACM
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Multidimensional access methods
ACM Computing Surveys (CSUR)
The small-world phenomenon: an algorithmic perspective
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
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
King: estimating latency between arbitrary internet end hosts
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Kademlia: A Peer-to-Peer Information System Based on the XOR Metric
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Novel architectures for P2P applications: the continuous-discrete approach
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
CCGRID '03 Proceedings of the 3st International Symposium on Cluster Computing and the Grid
Scalable, Efficient Range Queries for Grid Information Services
P2P '02 Proceedings of the Second International Conference on Peer-to-Peer Computing
Simple efficient load balancing algorithms for peer-to-peer systems
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Mercury: supporting scalable multi-attribute range queries
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
One torus to rule them all: multi-dimensional queries in P2P systems
Proceedings of the 7th International Workshop on the Web and Databases: colocated with ACM SIGMOD/PODS 2004
Communications of the ACM - Bioinformatics
SWAM: a family of access methods for similarity-search in peer-to-peer data networks
Proceedings of the thirteenth ACM international conference on Information and knowledge management
Enabling Flexible Queries with Guarantees in P2P Systems
IEEE Internet Computing
A case study in building layered DHT applications
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
The Essence of P2P: A Reference Architecture for Overlay Networks
P2P '05 Proceedings of the Fifth IEEE International Conference on Peer-to-Peer Computing
Supporting Multi-Dimensional Range Queries in Peer-to-Peer Systems
P2P '05 Proceedings of the Fifth IEEE International Conference on Peer-to-Peer Computing
Online balancing of range-partitioned data with applications to peer-to-peer systems
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Tapestry: a resilient global-scale overlay for service deployment
IEEE Journal on Selected Areas in Communications
Self Management for Large-Scale Distributed Systems: An Overview of the SELFMAN Project
Formal Methods for Components and Objects
P2P Networking and Applications
P2P Networking and Applications
Replica-aware, multi-dimensional range queries in Distributed Hash Tables
Computer Communications
An adaptive resource/performance trade-off for resolving complex queries in P2P networks
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Review: A survey on content-centric technologies for the current Internet: CDN and P2P solutions
Computer Communications
Building a network-aware and load-balanced peer-to-peer system for range queries
Computer Networks: The International Journal of Computer and Telecommunications Networking
Performance Evaluation of Range Queries in Key Value Stores
Journal of Grid Computing
Simple dynamic load balancing mechanism for structured P2P network and its evaluation
International Journal of Grid and Utility Computing
| Hi-index | 0.24 |
The efficient handling of range queries in peer-to-peer systems is still an open issue. Several approaches exist, but their lookup schemes are either too expensive (space-filling curves) or their queries lack expressiveness (topology-driven data distribution). We present two structured overlay networks that support arbitrary range queries. The first one, named Chord^#, has been derived from Chord by substituting Chord's hashing function by a key-order preserving function. It has a logarithmic routing performance and it supports range queries, which is not possible with Chord. Its O(1) pointer update algorithm can be applied to any peer-to-peer routing protocol with exponentially increasing pointers. We present a formal proof of the logarithmic routing performance and show empirical results that demonstrate the superiority of Chord^# over Chord in systems with high churn rates. We then extend our routing scheme to multiple dimensions, resulting in SONAR, a Structured Overlay Network with Arbitrary Range queries. SONAR covers multi-dimensional data spaces and, in contrast to other approaches, SONAR's range queries are not restricted to rectangular shapes but may have arbitrary shapes. Empirical results with a data set of two million objects show the logarithmic routing performance in a geospatial domain.