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.
https://hal.inria.fr/hal-01092251
Contributeur : Sébastien Monnet
<>
Soumis le : lundi 8 décembre 2014 - 14:36:58
Dernière modification le : mardi 17 avril 2018 - 11:33:57
Document(s) archivé(s) le : lundi 9 mars 2015 - 11:56:09
