Replica-aware, multi-dimensional range queries in Distributed Hash Tables

Authors:
Antony Chazapis;Athanasia Asiki;Georgios Tsoukalas;Dimitrios Tsoumakos;Nectarios Koziris
Affiliations:
Computing Systems Laboratory, School of Electrical and Computer Engineering, National Technical University of Athens, Greece;Computing Systems Laboratory, School of Electrical and Computer Engineering, National Technical University of Athens, Greece;Computing Systems Laboratory, School of Electrical and Computer Engineering, National Technical University of Athens, Greece;Computing Systems Laboratory, School of Electrical and Computer Engineering, National Technical University of Athens, Greece;Computing Systems Laboratory, School of Electrical and Computer Engineering, National Technical University of Athens, Greece
Venue:
Computer Communications
Year:
2010

Citing 29
Cited 1

Skip lists: a probabilistic alternative to balanced trees

Communications of the ACM
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
Looking up data in P2P systems

Communications of the ACM
Analysis of the Clustering Properties of the Hilbert Space-Filling Curve

IEEE Transactions on Knowledge and Data Engineering
Integrating the UB-Tree into a Database System Kernel

VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
The Universal B-Tree for Multidimensional Indexing: general Concepts

WWCA '97 Proceedings of the International Conference on Worldwide Computing and Its Applications
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
Serving DNS Using a Peer-to-Peer Lookup Service

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
Scalable, Efficient Range Queries for Grid Information Services

P2P '02 Proceedings of the Second International Conference on Peer-to-Peer Computing
Brief announcement: prefix hash tree

Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
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
Querying peer-to-peer networks using P-trees

Proceedings of the 7th International Workshop on the Web and Databases: colocated with ACM SIGMOD/PODS 2004
An Adaptive Protocol for Efficient Support of Range Queries in DHT-Based Systems

ICNP '04 Proceedings of the 12th IEEE International Conference on Network Protocols
A case study in building layered DHT applications

Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
A Scalable P2P Platform for the Knowledge Grid

IEEE Transactions on Knowledge and Data Engineering
Range Queries in Trie-Structured Overlays

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
CISS: An efficient object clustering framework for DHT-based peer-to-peer applications

Computer Networks: The International Journal of Computer and Telecommunications Networking
Using a distributed quadtree index in peer-to-peer networks

The VLDB Journal — The International Journal on Very Large Data Bases
Skip graphs

ACM Transactions on Algorithms (TALG)
Range queries on structured overlay networks

Computer Communications
Range queries over skip tree graphs

Computer Communications
Squid: Enabling search in DHT-based systems

Journal of Parallel and Distributed Computing
Efficient Range Query Processing in Peer-to-Peer Systems

IEEE Transactions on Knowledge and Data Engineering
A grid middleware for data management exploiting peer-to-peer techniques

Future Generation Computer Systems
Tapestry: a resilient global-scale overlay for service deployment

IEEE Journal on Selected Areas in 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

Quantified Score

Hi-index	0.24

Visualization

Abstract

In this paper, we present and evaluate a protocol that enables fast and accurate range-query execution in Distributed Hash Tables (DHTs). Range queries are of particular importance when the network is populated with groups or collections of data items, whose respective identifiers are generated in a way that encodes semantic relationships into key distances. Contrary to related work in the same direction, our proposed query engine is aware of data replicas at the DHT level and by grouping related nodes into replica neighborhoods, resolves queries with the minimum amount of messaging overhead. Moreover, we suggest pairing respective operations with the core DHT routing mechanics, which allows for reusing existing management and monitoring structures and automatically adapting the query path to the dynamic characteristics of the overlay. We also present an application scenario and the respective deployment details of a prototype implementation in the context of the Gredia project.