FreeSplit: A Write-Ahead Protocol to Improve Latency in Distributed Prefix Tree Indexing Structures - Sorbonne Université Access content directly
Conference Papers Year : 2015

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.
Fichier principal
Vignette du fichier
freesplit-Cortes-AINA15.pdf (320.35 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01095702 , version 1 (16-12-2014)

Identifiers

  • HAL Id : hal-01095702 , version 1

Cite

Rudyar Cortés, Xavier Bonnaire, Olivier Marin, Pierre Sens. FreeSplit: A Write-Ahead Protocol to Improve Latency in Distributed Prefix Tree Indexing Structures. 29th IEEE International Conference on Advanced Information Networking and Applications (AINA-2015), Mar 2015, Gwangju, South Korea. ⟨hal-01095702⟩
321 View
175 Download

Share

Gmail Facebook X LinkedIn More