Georg Gottlob Database and AI Group Technische Universit at Wien A-1040...  Home/Search
Context Related
| lfcs.inf.ed.ac.uk/...s03_complexity.pdf Cached: PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
PS.gz PS Image Update HelpFrom: lfcs.inf.ed.ac....publication2003 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In this paper, we study the precise complexity of XPath 1.0 query processing. Even though heavily used by its incorporation into a variety of XML-related standards, the precise cost of evaluating an XPath query is not yet wellunderstood. The first polynomial-time algorithm for XPath processing (with respect to combined complexity) was proposed only recently, and even to this day all major XPath engines take time exponential in the size of the input queries. From the standpoint of theory, the... (Update)
Cited by: More
XQuery Optimization - Philippe Michiels Ua (Correct)
Using Reflection for Querying XML Documents - Markus Kirchberg Faizal (Correct)
Rewriting XPath Queries Using Materialized Views - Xu, Ozsoyoglu (2005) (Correct)
Active bibliography (related documents): More All
0.7: The Complexity of XPath Query Evaluation - Gottlob, Koch, Pichler (2003) (Correct)
0.3: Interactive Proof Systems And Alternating Time-Space Complexity - Lance Fortnow (1991) (Correct)
0.1: XPath Processing in a Nutshell - Gottlob, Koch, Pichler (2003) (Correct)
Similar documents based on text:
3.0: Unknown - (Correct)
Related documents from co-citation: More All
5: Structural Properties of XPath Fragments - Benedikt, Fan et al. - 2003
5: Containment and Equivalence for an XPath Fragment - Miklau, Suciu - 2002
4: Monadic Queries over TreeStructured Data - Gottlob, Koch - 2002
BibTeX entry: (Update)
G. Gottlob, C. Koch, and R. Pichler. The complexity of XPATH query evaluation. In Proceedings of the ACM Symposium on Principle of Databases Systems, pages 179--190. 2003. http://citeseer.ist.psu.edu/gottlob03complexity.html More
@misc{ gottlob03complexity,
author = "G. Gottlob and C. Koch and R. Pichler",
title = "The complexity of XPATH query evaluation",
text = "G. Gottlob, C. Koch, and R. Pichler. The complexity of XPATH query evaluation.
In Proceedings of the ACM Symposium on Principle of Databases Systems, pages
179--190. 2003.",
year = "2003",
url = "citeseer.ist.psu.edu/gottlob03complexity.html" }
Citations (may not include all citations):951 Computational Complexity (context) - Papadimitriou - 1994
379 The Complexity of Relational Query Languages (context) - Vardi - 1982
274 A Catalog of Complexity Classes (context) - Johnson - 1990
97 Limits to Parallel Computation: P-Completeness Theory - Greenlaw, Hoover et al. - 1995
65 XML Path Language (context) - Web - 1999
48 Two Applications of Inductive Counting for Complementation P.. (context) - Borodin, Cook et al. - 1989
41 Properties that Characterize LOGCFL (context) - Venkateswaran - 1991
29 Problems Complete for Deterministic Logarithmic Space (context) - Cook, McKenzie - 1987
28 WC Working Draft (context) - Web, XQuery et al. - 2002
21 XPath Query Evaluation: Improving Time and Space E#ciency - Gottlob, Koch et al. - 2003
21 Two Semantics for XPath - Wadler - 2000
13 E#cient Algorithms for Processing XPath Queries (context) - Gottlob, Koch et al. - 2002
7 Typing and Querying XML Documents: Some Complexity Bounds (context) - Segoufin - 2003
3 Time and Tape Bounded Auxiliary Pushdown Automata (context) - Sudborough - 1977
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.lfcs.inf.ed.ac.uk/research/database/publication2003.html): More
Capturing both Types and Constraints in Data Integration - Benedikt Wenfei Rastogi (2003) (Correct)
Ecient Processing of Expressive Node-Selecting - Queries On Xml (Correct)
Path Queries on Compressed XML - Peter Buneman Martin (2003) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC