{'fraction_non_alphanumeric': 0.030612244897959183, 'fraction_numerical': 0.0, 'mean_word_length': 4.793248945147679, '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}}
KSAM: A B+-tree-based keyed sequential-access method

This paper reports research undertaken to design and implement a B+-tree-based keyed sequential-access method (KSAM). KSAM provides primary and secondary access, which can be based on direct or sequential processing. Primary access to a data file requires three levels of indexes: super, master, and primary indexes. Secondary access requires an additional index level: secondary indexes. The superindex and master indexes are transparent to the user and are used solely by the system.
 The primary index is organized as a B+-tree containing proper linkages to the respective data files. In the implementation of secondary indexes a file is used to store accession lists of the secondary indexes, and each secondary index is in turn organized as a B+-tree containing proper linkages to accession list files. Thus, linkage from the B+-tree of a secondary index to the respective data files is provided via the accession list file. Finally, another file is used to represent all the B+-trees associated with a data file. Thus, three files suffice for the implementation of a KSAM data file and its associated indexes. The implementation schema organizes each of the three files as a direct-access file. Thus the high popularity of direct-access files makes the implementation possible in almost any programming language.