{'fraction_non_alphanumeric': 0.014167650531286895, 'fraction_numerical': 0.0, 'mean_word_length': 5.01418439716312, '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}}
Application of Sparse Matrix Techniques to Search, Retrieval, Classification and Relationship Analysis in Large Data Base Systems - SPARCOM

In order to meet the requirements of Large Data Base (LDB) Systems for short response time and high throughput a new approach has been investigated. In this paper only certain aspects of a powerful system, called SPARCOM, are described. The unique approach of this system is the conceptual conversion of data into large sparse binary matrices that enables one to apply sophisticated sparse matrix techniques to perform data base operations. Only for the sake of clarity the matrices are presented in their binary form. The high performance of the system is due to the direct conversion and manipulation of the matrices in their compact form as obtained from the application of the sparse matrix algorithms.