{'fraction_non_alphanumeric': 0.017937219730941704, 'fraction_numerical': 0.0, 'mean_word_length': 4.982142857142857, '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 New Approach of R-tree Construction

R-tree is a crucial technique for spatial index. However, coverage and overlap produced by traditional methods are big side effects. In order to minimize the overlap and reduce the coverage, this paper proposes a new R-tree construction method based on clustering algorithm which can minimize the overlap and reduce the coverage to a great extent. This method resolves effectively the clustering storage for the adjacent data, and reduces the overlap between spatial nodes. Comparisons and experiments are conducted and performances are evaluated for this method. The results show that this method has high efficiency in querying.