With the rapidly increasing popularity of XML as a model for data representation and exchange on the Internet, there is a lot of interest in efficient storage of data that conforms to a labeled-tree data model. In this paper, we propose a novel structure that is capable of evaluating XML queries without re-parsing the XML document. Unlike existing approaches to store XML documents, the proposed structure stores only paths of an XML document. Therefore, the proposed structure is superior as the structure size is reduced. We present algorithms for evaluation of XPath queries on documents stored in the new structure. The paper also presents algorithms that update the structure taking into consideration both value and schema updates on XML document
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.