Open AccessProceedings Article
Range-capable Distributed Hash Tables.
Alessandro Soro,Cristian Lai +1 more
- 01 Jan 2006
TL;DR: 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 is presented.
read more
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.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
SEARCHY: An Agent to Personalize Search Results
Ivan Marcialis,E. De Vita +1 more
- 08 Jun 2008
TL;DR: A simple way to machine-learn user profile and employ it to improve Web searches using Searchy, a personal agent embedded in the Web browser, able to sense user's tastes, to assist her/him during query formulation phase and, finally, to filter and sort the results according to the user's needs.
29
•Proceedings Article
DART: the distributed agent-based retrieval toolkit
Manuela Angioni,Roberto Demontis,Massimo Deriu,Emanuela De Vita,Cristian Lai,Ivan Marcialis,Antonio Pintus,Andrea Piras,Alessandro Soro,Franco Tuveri +9 more
- 01 Jan 2007
TL;DR: The studies, the concepts and the solutions developed in the DART project are described to introduce these three key features in a novel search engine architecture: semantics, geo-referencing, collaboration/distribution.
•Proceedings Article
A collaborative, semantic and context aware search engine
Manuela Angioni,Roberto Demontis,Massimo Deriu,Emanuela De Vita,Cristian Lai,Ivan Marcialis,Gavino Paddeu,Antonio Pintus,Andrea Piras,Raffaella Sanna,Alessandro Soro,Franco Tuveri +11 more
- 01 Jun 2007
TL;DR: This paper exposes the studies, the concepts and the solutions of a research project to introduce these three key features in a novel search engine architecture: collaboration, geo-referencing and semantics.
DSTree: A Spatio-Temporal Indexing Data Structure for Distributed Networks
Majid Hojati,Steven A. Roberts,Colin Robertson +2 more
TL;DR: DSTree is a spatio-temporal indexing data structure designed for distributed networks. It eliminates the need for additional DHTs and improves spatio-temporal query performance.
1
DSTree: A Spatio-Temporal Indexing Data Structure for Distributed Networks
Majid Hojati,Steven A. Roberts,Colin Robertson +2 more
- 18 Mar 2024
TL;DR: DSTree is a spatio-temporal indexing data structure designed for distributed networks. It eliminates the need for additional DHTs to perform multi-dimensional range queries and efficiently updates geographic information.
1
References
Kademlia: A Peer-to-Peer Information System Based on the XOR Metric
Petar Maymounkov,David Mazières +1 more
- 07 Mar 2002
TL;DR: In this paper, the authors describe a peer-to-peer distributed hash table with provable consistency and performance in a fault-prone environment, which routes queries and locates nodes using a novel XOR-based metric topology.
Skip lists: a probabilistic alternative to balanced trees
TL;DR: Skip lists as mentioned in this paper are data structures that use probabilistic balancing rather than strictly enforced balancing, and the algorithms for insertion and deletion in skip lists are much simpler and significantly faster than equivalent algorithms for balanced trees.
Skip Lists: A Probabilistic Alternative to Balanced Trees
William Pugh
- 17 Aug 1989
TL;DR: This paper describes and analyzes skip lists and presents new techniques for analyzing probabilistic algorithms.
Linear clustering of objects with multiple attributes
H. V. Jagadish
- 01 May 1990
TL;DR: A mapping based on Hilbert's space-filling curve is presented, which out-performs previously proposed mappings on average over a variety of different operating conditions.
A peer-to-peer information system based on the XOR metric
Petar Maymounkov
- 01 Jan 2002
TL;DR: A peer-to-peer distributed hash table with provable consistency and performance in a fault-prone environment is described using a novel XOR-based metric topology that simplifies the algorithm and facilitates the proof.
266
Related Papers (5)
Yu-En Lu,Steven Hand,Pietro Liò +2 more
- 31 Aug 2005
Charalampos Papamanthou,Roberto Tamassia,Nikos Triandopoulos +2 more
- 27 Oct 2008