{'fraction_non_alphanumeric': 0.029166666666666667, 'fraction_numerical': 0.0, 'mean_word_length': 4.380597014925373, '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}}
FRINGED-QUADTREES: A NEW KIND OF DATA STRUCTURE

In our everyday life we have to deal with dierent problems that, in most cases, need new data structures. At first sight, these structures do not look like any known data structure. This paper presents a data structure wehave called "fringed-quadtree". This structure is a tree with nodes that may be roots or leaves. A root-node may have at most four leaves. These trees may be built considering some rules that are presented in the paper. Due to the specific queries, the pointers will be ascending for the root-nodes and descending for the leaves. The time complexity of the described algorithms is logarithmic or linear and the memory space needed has the order O(n).