Efficient Algorithms for Processing XPath Queries

Our experimental analysis of several popular XPath processors reveals a striking fact: Query evaluation in each of the systems requires time exponential in the size of queries in the worst case. We show that XPath can be processed much more efficiently, and propose main-memory algorithms for this problem with polynomial-time combined query evaluation complexity. Moreover, we present two fragments of XPath for which linear-time query processing algorithms exist.

• Type: Journal
• Year: 2002
• Where: VLDB
• Authors: Georg Gottlob, Christoph Koch, Reinhard Pichler
• Keywords: Database, Popular Xpath Processors, Query Evaluation, VLDB 2002, XPath