{'fraction_non_alphanumeric': 0.01368421052631579, 'fraction_numerical': 0.0, 'mean_word_length': 4.798780487804878, '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}}
Enhanced KStore with the use of dictionary and Trie for retail business data

To support efficient business data analytics, having a good computer data structure to store and access business data is a top priority. KStore is a data structure proposed by Jane Campbell Mazzagatti based on the Phaneron of C. S. Peirce. KStore is designed and developed as a storage engine to support business intelligence data storage, queries and analysis. The generation and data access of KStore use two kinds of linked lists of which one represents one hierarchical relationship of nodes in the tree, and the other records all the other relationships between the dataset elements encountered in the input. When the input business dataset is large, the length of linked lists become longer and a KStore query becomes time-consuming. This bad query situation was changed and the query performance of KStore was improved by using Trie and a Dictionary data structure.