{'fraction_non_alphanumeric': 0.029888983774551667, 'fraction_numerical': 0.0, 'mean_word_length': 4.889447236180905, '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}}
SBT-forest, an indexing approach for specialized binary tree

In our previous work, a time series representation framework, specialized binary tree (SB-tree) has been proposed for representing the stock time series data effectively and efficiently. By putting a set of SB-trees together, a time series database is formed while we termed it as a specialized binary tree-forest (i.e. SBT-forest). By manipulating the SBT-forest, different time series query and mining processes can be facilitated. However, the major challenge is how to locate a SB-tree in the forest efficiently. Therefore, the development of an indexing approach for the SB-trees is of fundamental importance for maintaining an acceptable speed for query. In this paper, a time series indexing approach, based on transforming the SB-trees to symbol strings first and then indexing the symbol strings by a trie data structure, is proposed. The proposed approach is efficient and effective as well. As demonstrated in the experiments, the proposed approach speeds up the time series query process. The proposed approach can handle the problem of updating new entries to the database without any difficulty.