{'fraction_non_alphanumeric': 0.01131687242798354, 'fraction_numerical': 0.0030864197530864196, 'mean_word_length': 5.530201342281879, '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}}
A Structured P2P System with Match Path and Probability Balance Tree

Excellent P2P network infrastructure should support scalability and efficient search simultaneity. The intelligent routing mechanisms have flexible query expression but hold low scalability and recall rate. Contrastively, DHTs are scalable but either difficult to organize or too expensive for maintenance. A new structured P2P model is proposed in which resource storages are organized by match path and random access method. When an approximately balance distributed character is obtained, nodes will keep high search efficiency and low maintenance cost. The system supports various query models, has load balancing capability and high scalability, and ensures search range of each node can cover entire network. The system runs without any center service while all nodes simultaneously take index storage, data storage and routing task to drive network by only maintaining a little local information