Regular path expression is one of the core components of XML query languages, and several approaches to evaluating regular path expressions have been proposed. In this paper, a new path expression evaluation approach, extent join, is proposed to compute both parent-children ('/') and ancestor-descendent ('//') connectors between path steps. Furthermore, two path expression optimization rules, path-shortening and path-complementing, are proposed. The former reduces the number of joins by shortening the path while the latter optimizes the execution of a path by using an equivalent complementary path expression to compute the original path. Experimental results show that the algorithms proposed in this paper are much more efficient than conventional ones. © Springer-Verlag Berlin Heidelberg 2003.
CITATION STYLE
Wang, G., & Liu, M. (2003). Query processing and optimization for regular path expressions. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2681, 30–45. https://doi.org/10.1007/3-540-45017-3_5
Mendeley helps you to discover research relevant for your work.