{'fraction_non_alphanumeric': 0.020100502512562814, 'fraction_numerical': 0.0, 'mean_word_length': 4.385135135135135, '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}}
Indexing XML Data with UB-trees

Using the terminology usual in databases, it is possible to view XML as a language for data modelling. To retrieve XML data from XML databases, several query languages have been proposed. The common feature of these languages is the use of regular path expressions. Users are allowed to navigate through arbitrary long paths in the data by regular path expressions. Several index structures for XML data have been developed in recent years in order to address this problem. This paper is going to show how the UB-trees can index and retrieve XML documents efficiently. UB-trees were introduced by R. Bayer as a structure for indexing n-dimensional space. The basic idea of UB-tree index is that the indexing is performed at the lowest level of the given XML data.