{'fraction_non_alphanumeric': 0.024526198439241916, 'fraction_numerical': 0.002229654403567447, 'mean_word_length': 5.27972027972028, '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}}
Efficient range queries in spatial Peer-to-Peer networks

Recently, many geographic information systems (GIS) utilize peer-to-peer (P2P) systems to overcome the current problems with client/server GIS systems such as non-scalability, high bandwidth requirement and single point of failure. In this paper, we propose an efficient scheme to support efficient range query processing over structured P2P systems, while balancing the storage load. The paper proposes a rotating token approach to balance the storage load by placing joining nodes in appropriate locations in the identifier space to share loads with already overloaded nodes. Then, to support range queries, we utilize an order preserving mapping function to map keys to nodes in order preserving way without hashing. In this study, we carry simulation experiments with synthetic data to measure the performance of the proposed approach.