Sciweavers

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

8

PODS
2003
ACM

favoriteEmaildiscussreport

116views Database» more PODS 2003»

The complexity of XPath query evaluation

14 years 4 months ago

The complexity of XPath query evaluation

Download www.cs.cornell.edu

Georg Gottlob, Christoph Koch, Reinhard Pichler

Real-time Traffic

Database | PODS 2003 | XPath Query Evaluation |

claim paper

Related Content

» Algebraic Optimization of Nested XPath Expressions

» Efficient Algorithms for Processing XPath Queries

» Filtering Unsatisfiable XPATH Queries

» Distributed query evaluation with performance guarantees

» An Efficient XPath Query Processor for XML Streams

» Fast Answering of XPath Query Workloads on Web Collections

» A fast XPATH evaluation technique with the facility of updates

» XPath transitive closure logic and nested tree walking automata

» On the Memory Requirements of XPath Evaluation over XML Streams

Post Info
More Details (n/a)

Added	08 Dec 2009
Updated	08 Dec 2009
Type	Conference
Year	2003
Where	PODS
Authors	Georg Gottlob, Christoph Koch, Reinhard Pichler

Comments (0)