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
Efficient algorithms for processing XPath queries
ACM Transactions on Database Systems (TODS)
XPath evaluation in linear time
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
ACM Computing Surveys (CSUR)
Simple linear work suffix array construction
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
ACM Transactions on Database Systems (TODS)
Efficient evaluation of nondeterministic automata using factorization forests
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
SXPath: extending XPath towards spatial querying on web documents
Proceedings of the VLDB Endowment
Queries on Xml streams with bounded delay and concurrency
Information and Computation
Context-preserving XQuery fusion
APLAS'10 Proceedings of the 8th Asian conference on Programming languages and systems
XPath evaluation in linear time
Journal of the ACM (JACM)
| 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 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.