Skip to Main content Skip to Navigation

TPT-C: A Heuristic-Based Cache to Improve Range Queries over DHTs

Abstract : Distributed Hash Tables (DHTs) provide the substrate to build large scale distributed applications over Peer-to-Peer networks. A major limitation of DHTs is that they only support exact-match queries. In order to offer range queries over a DHT it is necessary to build additional indexing structures. Prefix-based indexes, such as Prefix Hash Tree (PHT), are interesting approaches for building distributed indexes on top of DHTs. Nevertheless, the lookup operation of these indexes usually generates a high amount of unnecessary traffic overhead which degrades system performance by increasing response time. In this paper, we propose a novel distributed cache system called Tabu Prefix Table (TPT-C), aiming at improving the performance of the Prefix-trees. We have implemented our solution over PHT, and the results confirm that our approach outperforms traditional existing cache solutions for prefix-tree structures.
Complete list of metadata

Cited literature [22 references]  Display  Hide  Download
Contributor : Pierre Sens Connect in order to contact the contributor
Submitted on : Friday, March 18, 2011 - 3:41:27 PM
Last modification on : Tuesday, August 24, 2021 - 4:52:06 PM
Long-term archiving on: : Thursday, November 8, 2012 - 12:11:03 PM


Files produced by the author(s)


  • HAL Id : inria-00578189, version 1


Nicolas Hidalgo, Luciana Arantes, Pierre Sens, Xavier Bonnaire. TPT-C: A Heuristic-Based Cache to Improve Range Queries over DHTs. [Research Report] RR-7576, INRIA. 2011, pp.24. ⟨inria-00578189⟩



Record views


Files downloads