Querying Tree-Based Data using A Simple Structural Indexing Technique

Extensible markup language (XML) has been widely used as the standard for data exchange over the Internet. With the advent of loT, a massive amount of homogeneous data generated from connected devices in loT environment is stored in XML. Searching for all occurrences of a twig pattern in an XML document is an important operation in XML query processing. Another important direction is to build structural indexes over XML Data to avoid unnecessary scanning of document partitions. This project aims to propose a novel Structural Indexing Technique to partition tree-based data. Consequently, the partitioned data will be mapped into RDB for fast information retrieval using a simple and efficient mapping scheme. For data indexing, a simple node labelling scheme will be used to facilitate processing tree-based queries.The new approach can be implemented using any programming language and the underlying data model could be an open source RDB.A set of experiments will be conducted to demonstrate the efficiency and effectiveness of the proposed approach.