{'fraction_non_alphanumeric': 0.014367816091954023, 'fraction_numerical': 0.0, 'mean_word_length': 5.6380952380952385, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Free Split: A Write-Ahead Protocol to Improve Latency in Distributed Prefix Tree Indexing Structures

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.