{'fraction_non_alphanumeric': 0.01893491124260355, 'fraction_numerical': 0.0, 'mean_word_length': 5.0, '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}}
Redundancy of Routing Information on the Distributed Key-Value Store Based on Order Preserving Linear Hashing and Skip Graph with the Load Balancing Method

In this paper, redundancy of routing information on the distributed key-value store based on order preserving linear hashing and Skip Graph with the load balancing method is evaluated. In this system, data are divided by order preserving linear hashing and Skip Graph is used for overlay network. For load balancing, by storing many Skip Graph nodes in one physical node, any highest-load Skip Graph can be divided. By this method, load balancing can be done. But the number of Skip Graph nodes becomes very many, redundancy of routing information is expected. In this paper, redundant routing elements are classified and redundancy of the routing information is experimentally evaluated.