{'fraction_non_alphanumeric': 0.009873060648801129, 'fraction_numerical': 0.0, 'mean_word_length': 4.867768595041323, '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}}
Balancing methods for the QT-GHT structure

The optimal balanced structure of search trees is a base requirement in efficient data management. Despite the huge work on balancing trees in vector spaces, there are very few analysis related to search trees in general metric spaces. The paper gives first an overview of the proposed quality threshold hyperplane search tree architecture in general metric space then a special method is presented for selection of pilot elements. The novelty of the proposed method is that it takes a larger set of distances into account and it provides a good solution for not uniform distributions too. The last part of the paper shows test generation and efficiency comparison.