Xpath query optimization based on tree automata

Lanye Wang; Xiaoguang Hong

doi:10.1117/12.2011860

4 March 2013 Xpath query optimization based on tree automata

Lanye Wang, Xiaoguang Hong

Proceedings Volume 8768, International Conference on Graphic and Image Processing (ICGIP 2012); 87684X (2013) https://doi.org/10.1117/12.2011860
Event: 2012 International Conference on Graphic and Image Processing, 2012, Singapore, Singapore

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.

Citation Download Citation

Lanye Wang and Xiaoguang Hong "Xpath query optimization based on tree automata", Proc. SPIE 8768, International Conference on Graphic and Image Processing (ICGIP 2012), 87684X (4 March 2013); https://doi.org/10.1117/12.2011860

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available