Bringing Efficient Advanced Queries to Distributed Hash Tables

Authors:
Daniel Bauer;Paul Hurley;Roman Pletka;Marcel Waldvogel
Affiliations:
IBM Zurich Research Laboratory, Switzerland;IBM Zurich Research Laboratory, Switzerland;IBM Zurich Research Laboratory, Switzerland;IBM Zurich Research Laboratory, Switzerland
Venue:
LCN '04 Proceedings of the 29th Annual IEEE International Conference on Local Computer Networks
Year:
2004

Citing 0
Cited 4

Receiver-oriented design of Bloom filters for data-centric routing

Computer Networks: The International Journal of Computer and Telecommunications Networking
Zone indexing: Optimizing the balance between searching and indexing in a loosely structured overlay

Computer Networks: The International Journal of Computer and Telecommunications Networking
A comparative study of cuckoo search and bat algorithm for Bloom filter optimisation in spam filtering

International Journal of Bio-Inspired Computation
An IP Traceback Protocol using a Compressed Hash Table, a Sinkhole Router and Data Mining based on Network Forensics against Network Attacks

Future Generation Computer Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Interest in distributed storage is fueled by demand for reliability and resilience combined with ubiquitous availability. Peer-to-peer (P2P) storage networks are known for their decentralized control, self-organization, and adaptation. Advanced searching for documents and resources remains an open problem. The ooding approach favored by some P2P networks is ineffiencient in resource usage, but more scalable and resource-efficient solutions based on Distributed Hash Tables (DHT) lack in query expressiveness and exibility. In this paper, we address this issue and introduce new efficient, scalable, and completely distributed methods that strive to keep resource consumption by queries and index information as low as possible. We describe how to improve the handling of multiple subqueries combined through boolean set operators. The need for these operators is intensified y applications to go beyond simple exact keyword matches. We discuss, optimize, and analyze appropriate extensions to support range and prefix matching in DHTs.