Free split: A write-ahead protocol to improve latency in distributed prefix tree indexing structures. Marin, O.; Bonnaire, X.; Sens, P.; and Cortés, R. In volume 2015-April, pages 658-665, 2015.
doi  abstract   bibtex   
© 2015 IEEE.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 Free Split shows that Free Split significantly reduces maintenance overheads, and therefore improves query response time.
@inproceedings{10.1109/AINA.2015.250,
    abstract = "© 2015 IEEE.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 Free Split shows that Free Split significantly reduces maintenance overheads, and therefore improves query response time.",
    year = "2015",
    title = "Free split: A write-ahead protocol to improve latency in distributed prefix tree indexing structures",
    volume = "2015-April",
    keywords = "Big Data , Maintenance Protocol , Trie indexing",
    pages = "658-665",
    doi = "10.1109/AINA.2015.250",
    journal = "Proceedings - International Conference on Advanced Information Networking and Applications, AINA",
    author = "Marin, Olivier and Bonnaire, Xavier and Sens, Pierre and Cortés, Rudyar"
}
Downloads: 0