{'fraction_non_alphanumeric': 0.016883116883116882, 'fraction_numerical': 0.0, 'mean_word_length': 5.2682926829268295, '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 R*-Tree Based Semi-Dynamic Clustering Method for the Efficient Processing of Spatial Join in a Shared-Nothing Parallel Database System

The spatial join is a computationally expensive operator to implement. The efficient implementation of the spatial join operator is, thus, desirable. This paper discusses a new parallel algorithm that implements the spatial join in an efficient manner. The proposed algorithm is compared to an existing parallel spatial join algorithm, the clone join. Both algorithms have been implemented on a Beowulf cluster and compared using real datasets. An extensive experimental analysis reveals that the proposed algorithm exhibits superior performance both in declustering time as well as in the execution time of the spatial Join query.