Query Optimization of RFX Compact Storage using Strategy List

XML (extensible query language) has become part and parcel of Web for transporting information over the Internet. XML query languages provide us with powerful primitives to query a XML document. Many researches are ongoing, to effectively store XML documents and query the same. One among them is RFX compact storage, where XML documents are stored, with no redundancy of elements. In this paper, we develop an entirely new technique to process XPath queries in the RFX(redundancy free compact storage) in Kannan, R.S.A., et al, (2008), exploiting the self optimized nature of compact storage, using strategy list. We have defined certain categories of XPath queries such that any XPath query will fall under one of these categories. Our approach applies efficiently for all categories of queries (both correlated and uncorrelated)in Brantner, M., et al. We have also made some modifications in RFX compact storage, to make it suitable for storing and querying Inter and Intra relational XML documents. Experimental results conform that our approach is best suited for optimizing the XPath query for the RFX compact storage than any other existing techniques.