Effective XML data storage and distributed query retrieval system

As XML is gaining its popularity in data exchange over the Web, storing and querying XML data has become an important issue to be addressed especially in terms of support for interoperability and extensibility among various application domains. In order to support this, a dynamic context-driven data exchange architecture is needed. In this paper, we propose an efficient distributed query processing method by partitioning the large native XML repositories into different fragmentations. The query will be evaluated in the Query Evaluation Center to determine which Query Processor nodes to process the query. The uniqueness of our Query Processor lies in the use of a suitable labeling scheme and an efficient indexing scheme which is able to identify parent-child (P-C), ancestor-descendant (A-D) and sibling relationships and consequently retrieve the query result efficiently. Experimental results indicate that our proposed join algorithm, TwigINLAB2 performs about 23% better compared to TwigStack and 10% better than TwigINLAB1 for all types of queries.