{'fraction_non_alphanumeric': 0.026196928635953028, 'fraction_numerical': 0.0009033423667570009, 'mean_word_length': 5.087912087912088, '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}}
Load-Adaptive Indexing Method for Schema-less Searches

There is a growing need for a horizontal-integrated platform for machine to machine (M2M) applications. To facilitate high reusability of the various data stored on the platform, the platform's search function must be able to locate all data useful to a particular application. We refer to this cross-schema-manner search as a schema less search. We have proposed a tree-structured indexing method, called UBI-Tree, for efficient schema-less searches. UBI-Tree predicts usage frequencies of each query based on characteristics of stored data. Moreover, UBI-Tree classifies incoming data to improve the search performance of frequently used queries. One disadvantage of the conventional UBI-Tree is decreased search performance as a result of differences between predicted and actual frequencies. Therefore, we propose a new method to improve search performance. This method utilizes the query history and is based on the real search load. We show experimentally that our proposed method improves the average latency and throughput of search processes.