Efficient XPath evaluation

Wang, Bing.; Feng, Ling.; Shen, Yun.

doi:10.1007/11547686_17

Authors

Dr Bing Wang B.Wang@hull.ac.uk
Lecturer

Ling Feng

Yun Shen

Abstract

Inspired by the best querying performance of ViST among the rest of the approaches in the literature, and meanwhile to overcome its shortcomings, in this paper, we present another efficient and novel geometric sequence mechanism, which transforms XML documents and XPath queries into the corresponding geometric data/query sequences. XML querying is thus converted to finding non-contiguous geometric subsequence matches. Our approach ensures correct (i.e., without semantic false) and fast (i.e., without the costly post-processing phase) evaluation of XPath queries, while at the same time guaranteeing the linear space complexity. We demonstrate the significant performance improvement of our approach through a set of experiments on both synthetic and real-life data.

Book Type	Book Chapter
Start Date	Sep 12, 2005
Publication Date	Dec 31, 2005
Journal	ADVANCES IN DATABASES AND INFORMATION SYSTEMS, PROCEEDINGS
Publisher	Springer Publishing Company
Volume	3631
Pages	223-237
Series Title	Lecture Notes in Computer Science
Series Number	3631
Book Title	Advances in Databases and Information Systems
ISBN	9783540285854; 9783540318958
DOI	https://doi.org/10.1007/11547686_17
Publisher URL	https://link.springer.com/chapter/10.1007/11547686_17