Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

14

VLDB
2002
ACM

favoriteEmaildiscussreport

106views Database» more VLDB 2002»

Efficient Algorithms for Processing XPath Queries

13 years 4 months ago

Efficient Algorithms for Processing XPath Queries

Download www.vldb.org

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.

Georg Gottlob, Christoph Koch, Reinhard Pichler

Real-time Traffic

Database | Popular Xpath Processors | Query Evaluation | VLDB 2002 | XPath |

claim paper

Related Content

» XPath Processing in a Nutshell

» BLAS An Efficient XPath Processing System

» Efficient processing of XPath queries using indexes

» Efficient Support for Ordered XPath Processing in TreeUnaware Commercial Relational Databa...

» Processing queries on treestructured data efficiently

» Efficient Implementation of XPath Processor on MultiCore CPUs

» Xpath on steroids exploiting relational engines for xpath performance

» A Framework for Using Materialized XPath Views in XML Query Processing

» Distributed query evaluation with performance guarantees

Post Info
More Details (n/a)

Added	23 Dec 2010
Updated	23 Dec 2010
Type	Journal
Year	2002
Where	VLDB
Authors	Georg Gottlob, Christoph Koch, Reinhard Pichler

Comments (0)