{'fraction_non_alphanumeric': 0.0197869101978691, 'fraction_numerical': 0.0, 'mean_word_length': 4.875, '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}}
Line Segment Nearest Neighbor Query of Spatial Database Based on R*S-Tree

An algorithm for nearest neighbor query of Line Segment based on the R*S-tree is proposed. The dynamic spatial indexing structure for spatial line segments was constructed based on the R*S-tree, and the k-nearest neighbor of the target line segment were obtained by the hollow ball. The distance between the target line segment and the neighbor line segments was computed, and the neighbor line segments were sorted by the distance. The result shows that the algorithm can obtain nearest neighbor line segment accurately and effectively and has the strong adaptability of data type.