Fast algorithms for finding nearest common ancestors
SIAM Journal on Computing
Automata theory for XML researchers
ACM SIGMOD Record
LATIN '00 Proceedings of the 4th Latin American Symposium on Theoretical Informatics
Rapid identification of repeated patterns in strings, trees and arrays
STOC '72 Proceedings of the fourth annual ACM symposium on Theory of computing
Efficient algorithms for processing XPath queries
ACM Transactions on Database Systems (TODS)
Efficient algorithms for processing XPath queries
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
XPath evaluation in linear time
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
ACM Computing Surveys (CSUR)
XPath evaluation in linear time with polynomial combined complexity
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
DLT '09 Proceedings of the 13th International Conference on Developments in Language Theory
Simple linear work suffix array construction
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Deterministic regular expressions in linear time
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
Foundations of XML based on logic and automata: a snapshot
FoIKS'12 Proceedings of the 7th international conference on Foundations of Information and Knowledge Systems
Deciding twig-definability of node selecting tree automata
Proceedings of the 15th International Conference on Database Theory
Enumerating with constant delay the answers to a query
Proceedings of the 16th International Conference on Database Theory
Querying graph databases with XPath
Proceedings of the 16th International Conference on Database Theory
| Hi-index | 0.00 |
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 query in a bigger fragment with Kleene star allowed, the same can be done in time O(2O(|ϕ|)|t|) or in time O(|ϕ|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.