Affiliation:
1. Warsaw University, Warsaw, Poland
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 in a documenttcan be calculated in timeO(|φ|3|t|). We show that for a query in a bigger fragment with Kleene star allowed, the same can be done in timeO(2O(|φ|)|t|) or in timeO(|φ|3|t|log|t|). Finally, we present algorithms for binary queries of XPath, which do a precomputation on the document and then output the selected pairs with constant delay.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Reference13 articles.
1. Lecture Notes in Computer Science Series;Bender M. A.
2. XPath leashed
3. Bojańczyk M. 2009. Factorization forests. In Developments in Language Theory. 1--17. 10.1007/978-3-642-02737-6_1 Bojańczyk M. 2009. Factorization forests. In Developments in Language Theory. 1--17. 10.1007/978-3-642-02737-6_1
4. XPath evaluation in linear time
5. Clark J. and DeRose S. 1999. XML Path language (XPath) version 1.0 W3C recommendation. Tech. rep. W3C. Clark J. and DeRose S. 1999. XML Path language (XPath) version 1.0 W3C recommendation. Tech. rep. W3C.
Cited by
17 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. JSON: Data model and query languages;Information Systems;2020-03
2. Synchronizing Data Words for Register Automata;ACM Transactions on Computational Logic;2019-04-04
3. Decidable XPath Fragments in the Real World;Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems - PODS '19;2019
4. Enumeration of MSO Queries on Strings with Constant Delay and Logarithmic Updates;Proceedings of the 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems;2018-05-27
5. Satisfiability of Xpath on data trees;ACM SIGLOG News;2018-04-30