Evaluating XPath Expressions on Light Weight BitCube
XML has become a popular way of storing data and hence has also become a new standard for exchanging and representing data on internet. Many techniques have been proposed for indexing and retrieval of XML documents such as XTree, BitCube. In this paper a indexing structure known as Light Weight BitCube is proposed. LWBC is an extension to the earlier BitCube technique which overcomes the memory management problem of BitCube while maintaining the same query processing efficiency as that of BitCube. Many XPath expressions and BitCube operations are evaluated on this LWBC to show the query processing efficiency. The results are also compared with XQEngine, a well known XML Query Processing Engine.