Paper Info
Title
Range-capable Distributed Hash Tables
Abstract
In this paper, we present a novel indexing data structure called RDHT (Range capable Distributed Hash Table) derived from skip lists and specifically designed for storing and retrieving geographic data from a structured P2P network overlay. We have developed RDHTs as backend for the DART search engine, whose goal is to efficiently answer complex queries based on semantics and geographical context of the information stored in a P2P network. Queries are "range enabled", in the sense opposite of the exact matching. Range and semantic queries on location based resources make it possible to answer questions such as "Where is the nearest bookshop?". RDHTs merge the robustness and scalability of distributed hash tables with the simplicity and self maintenance of skip lists, while providing efficient support for range queries and proximity queries.
Year
Venue
Keywords
2006
GIR
distributed hash table,search engine.,peer to peer,skip list,search engine,data structure,range query,indexation
Field
DocType
Citations 
Hash tree,Information retrieval,Double hashing,Computer science,Merkle tree,Hash function,Hash chain,Hash list,Dynamic perfect hashing,Hash table
Conference
2
PageRank 
References 
Authors
0.40
9
2
Name
Order
Citations
PageRank
Alessandro Soro17917.99
Cristian Lai2176.66