ABSTRACT
We consider a fragment of XPath 1.0, where attribute and text values may be compared. We show that for any unary query in this fragment, the set of nodes that satisfy the query can be calculated in time linear in the document size and polynomial in the size of the query. The previous algorithm for this fragment also had linear data complexity but exponential complexity in the query size.
- M.A. Bender and M. Farach-Colton. The LCA problem revisited. In Latin American Theoretical Informatics, pages 88--94, 2000. Google Scholar
Digital Library
- M. Benedikt and C. Koch. XPath leashed. ACM Computing Surveys. Google Scholar
Digital Library
- M. BojaDczyk and P. Parys. XPath evaluation in linear time. In PODS, pages 241--250, 2008. Google Scholar
Digital Library
- J. Clark and S. DeRose. XML Path language (XPath) version 1.0, W3C recommendation. Technical report, W3C, 1999.Google Scholar
- G. Gottlob, C. Koch, and R. Pichler. XPath query evaluation: Improving time and space eficiency. In ICDE'03, pages 379--390, 2003.Google Scholar
Cross Ref
- G. Gottlob, C. Koch, and R. Pichler. Efficient algorithms for processing XPath queries. ACM Transactions on Database Systems, 30(2):444--491, 2005. Google Scholar
Digital Library
- D. Harel and R. Tarjan. Fast algorithms for finding nearest common ancestors. SIAM Journal on Computing, 13(2):338--355, 1984. Google Scholar
Digital Library
- J. Kärkkäinen and P. Sanders. Simple linear work suffix array construction. In International Conference on Automata, Languages and Programming, volume 2719 of Lecture Notes in Computer Science, pages 943--955, 2003. Google Scholar
Digital Library
- F. Neven. Automata theory for XML researchers. SIGMOD Record, 31(3), 2002. Google Scholar
Digital Library
Index Terms
XPath evaluation in linear time with polynomial combined complexity
Recommendations
XPath evaluation in linear time
We consider a fragment of XPath 1.0, where attribute and text values may be compared. We show that for any unary query φ in this fragment, the set of nodes that satisfy the query in a document t can be calculated in time O(|φ|3|t|). We show that for a ...
Visual Evaluation of XPath Queries
ICCIS '13: Proceedings of the 2013 International Conference on Computational and Information SciencesOver the past one decade, due to its simplicity and flexibility, Extensible Markup Language (XML) is rapidly gaining in popularity as a universal data format for data exchange and integration on the web. In this paper, we present a novel framework to ...
The complexity of XPath query evaluation and XML typing
We study the complexity of two central XML processing problems. The first is XPath 1.0 query processing, which has been shown to be in PTIME in previous work. We prove that both the data complexity and the query complexity of XPath 1.0 fall into lower (...






Comments