{'fraction_non_alphanumeric': 0.013194444444444444, 'fraction_numerical': 0.0, 'mean_word_length': 4.741035856573705, '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': 2, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
An Effective Algorithm for XML Tree Pattern Matching-A Holistic Approach

XML is a self-describing data representation format with a flexible structure. Since hundreds of XML-based languages have been developed, XML is widely accepted as a standard for data representation and information exchange over the internet. The major advantage of using XML is that it allows the users to create their own tags. This kind of increasing popularity of XML attracted the Business and enterprises to make queries on XML data more frequently. There is an increasing demand for efficient and effective query processing on XML data. For performing query processing operations an input XML File is required. Such an XML Files can be viewed as an XML Tree using DOM parser. XML-DOM Parser is mainly used to store, access and manipulate our XML Tree. We have proposed a new search engine named XML Search engine for pattern matching. This XML Search engine gets the input keyword query from the user and performs exact pattern matching for text, images and audio files based on an effective XML Tree Pattern Matching algorithm called TreeMatch. The downloading time of images and audio files in an XML Search engine is going to be compared with local search engine. Finally from the experimental results we are going to prove that our proposed XML Search engine performs exact pattern matching and takes less downloading time compared to local search engine.