{'fraction_non_alphanumeric': 0.02309782608695652, 'fraction_numerical': 0.0, 'mean_word_length': 6.297029702970297, '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}}
Beyond replicated storage: eventually-consistent distributed data structures

While our understanding of eventual consistency for replicated data has improved considerably over the past few years, relatively little work focused on eventually-consistent distributed data structures. By revisiting PL-Gossip, our self-managed, decentralized algorithm for maintaining cluster hierarchies in wireless sensor networks, this paper illustrates sample problems one is likely to encounter when dealing with such structures. Given the growing interest in analyzing huge, dynamic, inter-dependent data sets, we believe that the paper will inspire research to facilitate understanding and devising eventually-consistent distributed data structures.