{'fraction_non_alphanumeric': 0.017208413001912046, 'fraction_numerical': 0.0, 'mean_word_length': 5.158823529411765, '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}}
Distributed evaluation of XPath queries over large integrated XML data

XML is a widespread, text-based format used for exchanging information on the Web and representing metadata. Since the amount of XML information is rapidly increasing, efficient querying of large data repositories, containing XML data, is a significant challenge faced by system designers and data analysts who need to support operational actions and decision-making. In this paper we propose a technique for integrating large amount of XML data and use the Map-Reduce framework to efficiently query the integrated data. Each XML document obtained from the sources is transformed properly in order to fit into a predefined, virtual XML structure. Although the transformed documents are not physically integrated, the user is able to pose queries over a single XML structure. To achieve this feature we propose a single-step, Map-Reduce algorithm which takes advantage of virtual structure and computes efficiently the answer of a given XPath queries in a distributed manner.