Strategy List- An Efficient Querying Structure for RFX Compact Storage

Abstract

Extensible Markup Language (XML) has been regarded as a de facto form for data exchange over the Internet. The rapid growth of XML repositories has provided the intention to design and develop systems that can store and query the XML data efficiently. The self-describing nature of XML has a great flexibility and wide acceptance but on the other hand, the huge size of the XML documents is a major drawback. The huge document size means that the amount of information that has to be transmitted, processed, and stored and queried is often larger than that of other data formats. Many researchers are working to compactly store XML document in main memory and query the same. So far researchers have implemented the compact storage structure using pointer-based approach and succinct approach for XML. Existing query processing algorithms for nested query and also querying Intra and Inter structured documents beyond simple queries are not efficient for compact storage structures. In this paper an entirely new technique is proposed which process XPath queries in the RFX (Redundancy Free Compact Storage) a non-pointer-based approach, using Strategy List. As far as know, no similar approach has been proposed for XML yet. Performance has been evaluated using the Benchmark datasets. The performance results demonstrate that the path evaluation steps for the compact storage structure are highly efficient and outperform the other tested systems.