Georg Gottlob, Christoph Koch, and Reinhard Pichler. Efficient algorithms for processing XPath queries. In VLDB, 2002. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Structural Properties of XPath Fragments - Benedikt, Fan, Kuper (2003) (13 citations) (Correct)
....of element nodes within XML documents. It has been widely used in XML query languages (e.g. XSLT [7] XQL [22] XQuery [5] XML specifications (e.g. XML Schema [23] and subscription systems (e.g. 6] It supports a number of powerful modalities and thus is rather expensive to process [3, 18, 10]. In practice, many applications do not need the excessive power of the full language; they use only a fragment of XPath. For example, XML Schema specifies integrity constraints with an XPath fragment that does not support upward modalities (the parent and ancestor axes) It is thus necessary to ....
G. Gottlob, C. Koch, and R. Pichler. Efficient algorithms for processing XPath queries. In VLDB, 2002.
XPath Query Evaluation: Improving Time and Space Efficiency - Gottlob, Koch, Pichler (2003) (14 citations) Self-citation (Gottlob Koch Pichler) (Correct)
....sizes of input queries, a fact that has gone unnoticed for a long time. Recently, the first mainmemory evaluation algorithm for XPath 1. 0 with polynomial time combined complexity, i.e. which runs in polynomial time both with respect to the size of the data and the queries, has been published (cf. [11]) In this paper, we present several important improvements and extensions of that work, including new XPath processing algorithms with improved time and space efficiency. Moreover, we define a very large and practically relevant fragment of XPath for which a further optimized form of query ....
....this paper are covered by a pending patent. and complexity of various fragments of XSLT [3, 14, 2] and XML query pattern matching [15, 4, 6] have been investigated. However, only very recently, the first polynomialtime algorithm for evaluating arbitrary XPath 1. 0 queries has been published (cf. [11]) In contrast, experiments with three existing XPath processors (namely XALAN [19] XT [7] and Microsoft Internet Explorer 6) revealed that they all consume time exponential in the size of the queries in the worst case (cf. 11] The main contributions of this paper are the following: In ....
[Article contains additional citation context not shown here]
G. Gottlob, C. Koch, and R. Pichler. Efficient Algorithms for Processing XPath Queries. In Proc. VLDB'02, 2002.
Monadic Queries over Tree-Structured Data - Gottlob, Koch (2002) (14 citations) Self-citation (Gottlob Koch) (Correct)
.... Based on a wealth of elegant equivalences between regular tree languages, logics (MSO) and automata (cf. 28, 29, 6] there has recently been considerable research activity related to various theoretical aspects of XPath and XSLTlike query languages [25, 7, 5, 22, 24, 16] However, except for [17], which shows that XPath has polynomial time combined complexity, and the linear time combined complexity result for monadic datalog over trees of [16] no research results on good or even reasonable algorithms for processing XPath and similar languages have been published which may serve as ....
....of these expressions. Regular path expressions allow to conveniently express all of the XPath axis relations. Thus, all monadic datalog programs that consist solely of acyclic rules can be evaluated in linear time. We present the Core XPath language and, building on earlier work presented in [17], show that is has lineartime combined complexity. We describe analogies of Core XPath with monadic datalog over trees and CTL. We show that monadic datalog rules over child , firstchild , and nextsibling built ins can be efficiently rewritten into acyclic rules (using transitive closure ....
[Article contains additional citation context not shown here]
G. Gottlob, C. Koch, and R. Pichler. "Efficient Algorithms for Processing XPath Queries". In Proc. of the 28th International Conference on Very Large Data Bases (VLDB 2002.
Full-fledged Algebraic XPath Processing in Natix - Brantner, Helmer, Kanne.. (2005) (Correct)
No context found.
Georg Gottlob, Christoph Koch, and Reinhard Pichler. Efficient algorithms for processing XPath queries. In VLDB, 2002.
Nested Queries and Quantifiers in an Ordered Context - May, al. (2003) (1 citation) (Correct)
No context found.
G. Gottlob, C. Koch, and R. Pichler. Efficient algorithms for processing XPath queries. In Proc. Int. Conf. on Very Large Data Bases (VLDB), pages 95--106, 2002. 23
XQuery Optimization - Philippe Michiels Ua (Correct)
No context found.
G. Gottlob, C. Koch, and R. Pichler. Efficient algorithms for processing XPath queries. In VLDB 2002.
Mixed Mode XML Query Processing - Alan Halverson Josef (2003) (6 citations) (Correct)
No context found.
Gottlob et al. Efficient Algorithms for Processing XPath Queries. VLDB 2002.
Taming XPath Queries by Minimizing Wildcard Steps - Chee-Yong Chan Chancy (Correct)
No context found.
G. Gottlob, C. Koch, and R. Pichler. Efficient algorithms for processing XPath queries. In VLDB, pages 95--106, 2002.
Secure XML Querying with Security Views - Fan, Chan, Garofalakis (2004) (4 citations) (Correct)
No context found.
G. Gottlob, C. Koch, and R. Pichler. Efficient algorithms for processing XPath queries. In VLDB, 2002.
Taming XPath Queries by Minimizing Wildcard Steps - Chee-Yong Chan Chancy (2004) (Correct)
No context found.
G. Gottlob, C. Koch, and R. Pichler. Efficient algorithms for processing XPath queries. In VLDB, pages 95--106, 2002.
Nested Queries and Quantifiers in an Ordered Context - May, Helmer, Moerkotte (2003) (Correct)
No context found.
G. Gottlob, C. Koch, and R. Pichler. Efficient algorithms for processing XPath queries. In Proc. Int. Conf. on Very Large Data Bases (VLDB), pages 95--106, 2002. 23
Dynamic XML Documents with Distribution and Replication - Abiteboul, Bonifati.. (2003) (16 citations) (Correct)
No context found.
G. Gottlob, C. Koch, and R. Pichler. Efficient algorithms for processing XPath queries. In Proc. of VLDB, 2002.
XQuery Optimization - Michiels (Correct)
No context found.
G. Gottlob, C. Koch, and R. Pichler. Efficient algorithms for processing XPath queries. In VLDB 2002.
CTL Model Checking for Processing Simple XPath Queries - Afanasiev, Franceschet.. (2004) (Correct)
No context found.
G. Gottlob, C. Koch, and R. Pichler. Efficient Algorithms for Processing XPath Queries. In Proceedings of the International Conference on Very Large Data Bases (VLDB), 2002.
Mixed Mode XML Query Processing - Halverson, Burger, Galanis, Kini.. (2003) (6 citations) (Correct)
No context found.
Gottlob et al. Efficient Algorithms for Processing XPath Queries. VLDB 2002.
Query Evaluation on Compressed Trees (Extended Abstract) - Frick, Grohe, Koch (2003) (Correct)
No context found.
G. Gottlob, C. Koch, and R. Pichler. "Efficient Algorithms for Processing XPath Queries". In Proceedings of the 28th International Conference on Very Large Data Bases (VLDB'02), Hong Kong, China, 2002.
Path-expression Queries over Multiversion XML Documents - Vagena, Tsotras (2003) (Correct)
No context found.
G. Gottlob, C. Koch and R. Pichler, "Efficient Algorithms for Processing XPath Queries", Proc. of 28th International Conference on Very Large Data Bases (VLDB), Hong Kong, China, 2002.
Optimized Translation of XPath into Algebraic.. - Helmer, Kanne, Moerkotte (2002) (5 citations) (Correct)
No context found.
G. Gottlob, C. Koch, and R. Pichler. Efficient algorithms for processing XPath queries. In Proc. Int. Conf. on Very Large Data Bases (VLDB), pages 95--106, 2002.
Nested Queries and Quantifiers in an Ordered Context - May, Helmer, Moerkotte (2004) (Correct)
No context found.
G. Gottlob, C. Koch, and R. Pichler. Efficient algorithms for processing XPath queries. In Proc. Int. Conf. on Very Large Data Bases (VLDB), pages 95--106, 2002.
Dynamic XML Documents with Distribution and Replication - Abiteboul, Bonifati.. (2003) (16 citations) (Correct)
No context found.
G. Gottlob, C. Koch, and R. Pichler. Efficient algorithms for processing XPath queries. In Proc. of VLDB, 2002.
Query Evaluation on Compressed Trees (Extended Abstract) - Frick, Grohe, Koch (2003) (Correct)
No context found.
G. Gottlob, C. Koch, and R. Pichler. "Efficient Algorithms for Processing XPath Queries". In Proceedings of the 28th International Conference on Very Large Data Bases (VLDB'02), Hong Kong, China, 2002.
XPath with conditional axis relations - Marx (2004) (4 citations) (Correct)
No context found.
G. Gottlob, C. Koch, and R. Pichler. Efficient algorithms for processing XPath queries. In Proc. of the 28th International Conference on Very Large Data Bases (VLDB 2002), 2002.
Next-Generation Information Retrieval: Integrating Document and.. - Bremer (2003) (Correct)
No context found.
Georg Gottlob, Christoph Koch, and Reinhard Pichler. Efficient Algorithms for Processing XPath Queries. In Proceedings of the 28th International Conference on Very Large Data Bases (VLDB), pages 95--106, 2002.
Dynamic XML Documents with Distribution and Replication - Abiteboul, Bonifati.. (2003) (16 citations) (Correct)
No context found.
G. Gottlob, C. Koch, and R. Pichler. Efficient algorithms for processing XPath queries. In Proc. of VLDB, 2002.
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