{'fraction_non_alphanumeric': 0.013440860215053764, 'fraction_numerical': 0.002688172043010753, 'mean_word_length': 4.775193798449612, '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 Protocol for Text Retrieval in Structured P2P Networks

For the problems of complex queries, load balance and routing efficiency in structured P2P networks based on DHT, a protocol is presented for text retrieval on the basis of Kleinberg small world model. In this protocol, nodes are clustered to support complex query according to the similarity of nodes, and the grouped nodes could adjust their size to balance the load of networks. Routing path length is shortened by the long-link between node clusters. Experiment results show that search cost is increased with the curve of the square of logarithm and maintenance cost is linearly increased as the scale of networks goes up. The total cost will be minimized with proper cluster size.