Author： Wong Kam-Fai
Publisher： Springer Publishing Company
ISSN： 1386-145X
Source： World Wide Web, Vol.9, Iss.3, 2006-10, pp. : 277-299
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
The problem of answering XML queries using path-based indexes is to find efficient methods for accelerating the XML query with pre-designed index structures over the XML database. This problem received increasing interests and have been lucubrated in recent years. Regular path expression is the core of the XML query languages e.g., XPath and XQuery. Most of the state-of-the-art path-based XML indexes, therefore, hammer at how to efficiently answer the path-based XML queries. This paper surveys various approaches to indexing XML data proposed in the literature. We give a step by step analysis to show the evolution of index structures for XML path information, based on tree structures or more commonly, directed labeled graphs. For each approach, we first present the specific issue it aims to tackle, and then the proposed solution presented. Furthermore, construction, physical data storage and maintenance costs, are analyzed.
Related content
Path-based keyword search over XML streams
By BouSavongGraduate School of Systems and Information Engineering University of Tsukuba Tsukuba Japan AmagasaToshiyukiFaculty of Engineering Information and Systems University of Tsukuba Tsukuba Japan KitagawaHiroyukiFaculty of Engineering Information and Systems University of Tsukuba Tsukuba Japan
International Journal of Web Information Systems, Vol. 11, Iss. 3, 2015-08 ,pp. :
Access to resources
Recommend
