{'fraction_non_alphanumeric': 0.027348394768133173, 'fraction_numerical': 0.0, 'mean_word_length': 4.888111888111888, '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 Algorithm for Multi-way Distance Join Query

This paper presents K-DJQ algorithms for solving multi-way distance join query, which finds the K n-tuples from n spatial datasets that have the smallest distance value according to query graph. R-tree is used as index structure for each dataset. K-DJQ algorithm is recursive non-incremental approach following depth-first search strategy and synchronously traverses all R-trees, which returns the K n-tuples of the result all together at the end of the algorithm without producing any intermediate result. In addition, distance-based plane-sweep technique is used as optimization techniques for K-DJQ to reduce the total query processing time. Finally, performance and accuracy of K-DJQ algorithm are evaluated in terms of different K value and the number of datasets through experimentation.