{'fraction_non_alphanumeric': 0.03125, 'fraction_numerical': 0.00625, 'mean_word_length': 4.528735632183908, '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}}
Parallelizing the Construction of a k-Dimensional Tree

k-dimensional (k-d) trees are one of the most important data structures in the fields of data engineering and so-called Big Data. In this paper we propose a scheme parallelizing the construction of a k-d tree. Since efficient presorting is required for constructing a balanced k-d tree, we also developed a parallelized heapsort algorithm. The proposed scheme is 3.59 times faster than sequential construction of a k-d tree.