Efficient algorithms for processing XPath queries

✍ Scribed by Gottlob, Georg; Koch, Christoph; Pichler, Reinhard

• Book ID: 121460095
• Publisher: Association for Computing Machinery
• Year: 2005
• Tongue: English
• Weight: 705 KB
• Volume: 30
• Category: Article
• ISSN: 0362-5915
• DOI: 10.1145/1071610.1071614

✦ Synopsis

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 show how the main ideas of our algorithm can be profitably integrated into existing XPath processors. Finally, we present two fragments of XPath for which linear-time query processing algorithms exist and another fragment with linear-space/quadratic-time query processing.