Skip to Main content Skip to Navigation
Reports

FreeSplit: A Write-Ahead Protocol to Improve Latency in Distributed Prefix Tree Indexing Structures

Abstract : Distributed Prefix Tree indexing structures on top of peer-to-peer overlays provide a scalable solution to support range queries and proximity queries for Big Data applications. However, the latency of current maintenance protocols impacts very negatively on main operations like data insertions. This paper presents a new maintenance protocol that anticipates every data insertion on provisional child nodes. A performance evaluation conducted on the Prefix Hash Tree and FreeSplit shows that FreeSplit significantly reduces maintenance overheads, and therefore improves query response time.
Complete list of metadata

Cited literature [13 references]  Display  Hide  Download

https://hal.inria.fr/hal-01092251
Contributor : Sébastien Monnet Connect in order to contact the contributor
Submitted on : Monday, December 8, 2014 - 2:36:58 PM
Last modification on : Tuesday, March 22, 2022 - 11:10:10 AM
Long-term archiving on: : Monday, March 9, 2015 - 11:56:09 AM

File

RR-8637.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01092251, version 1

Citation

Rudyar Cortés, Xavier Bonnaire, Olivier Marin, Pierre Sens. FreeSplit: A Write-Ahead Protocol to Improve Latency in Distributed Prefix Tree Indexing Structures. [Research Report] RR-8637, INRIA Paris. 2014. ⟨hal-01092251⟩

Share

Metrics

Record views

145

Files downloads

137