{'fraction_non_alphanumeric': 0.015523932729624839, 'fraction_numerical': 0.0, 'mean_word_length': 5.192, '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}}
An Optimization Algorithm for Spatial Index Structure Based on Spatial Clustering

Spatial index has been one of the active focus areas in recent database research. The R-tree proposed by Guttman is probably the most popular dynamic index structure for efficiently retrieving objects from a spatial database according to their spatial locations. This paper proposes a new method of constructing R-tree by studying every kind of its operations thoroughly and combining with improved k-medoids clustering algorithm. Because of its more compact structure, the R-tree based on this method has more advantages compared with traditional Rtree. The results of the study show that, due to the optimization of structure, the proposed method can improve index efficiency effectively.