{'fraction_non_alphanumeric': 0.03389830508474576, 'fraction_numerical': 0.0, 'mean_word_length': 4.987341772151899, '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}}
Music databases: indexing techniques and implementation

A music database with search-by-content ability is studied. Chords are used to represent music. The input fault tolerance ability is equipped with the chord-representation model. The PAT-tree is proposed as the index structure. The "unstructured search" is an important characteristic of PAT-tree. We have implemented a music database system based on the chord-representation model and the PAT-tree index structure.