{'fraction_non_alphanumeric': 0.016930022573363433, 'fraction_numerical': 0.0, 'mean_word_length': 5.474452554744525, '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}}
Query processing in very large XML databases

The Extensible Markup Language (XML) model has recently gained huge popularity because of its ability to represent a wide variety of structured and semi-structured data. Several query languages have been proposed for the XML data model, the most-widely known is XQuery. Traditional XML query processing research has concentrated on the intra-document data retrieval and the structures in their support. In this paper, we review these algorithms and structures and show their superiority when processing independent XML documents. However, the direct application of these algorithms to process queries against interlinked XML documents are shown to generate incorrect results. New, extended version of these algorithms and structures are introduced and shown to perform correctly in processing both independent and inter-linked XML documents