Abstract
How to efficiently process XML query is a fundamental problem in XML data management. In this paper, a method based on tree automata is proposed to improve XPath query efficiency. The method has the following features: tree automata is employing to express XPath query; interval encoding is employing to mark XML document tree; when XPath query is running , by matching XPath tree automata and XML document tree, the process of nodes and sub-trees that do not match the XPath query can be skipped. Related algorithms are introduced. Experimental results demonstrate that the method proposed can effectively support XPath query and outperform the former work in efficiency.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
