Query automata over finite trees
Theoretical Computer Science
Automata theory for XML researchers
ACM SIGMOD Record
Monadic Queries over Tree-Structured Data
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Query Evaluation on Compressed Trees (Extended Abstract)
LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
The complexity of XPath query evaluation and XML typing
Journal of the ACM (JACM)
On the complexity of typechecking top-down XML transformations
Theoretical Computer Science - Database theory
Word Problems and Membership Problems on Compressed Words
SIAM Journal on Computing
Path queries on compressed XML
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Efficient memory representation of XML documents
DBPL'05 Proceedings of the 10th international conference on Database Programming Languages
| Hi-index | 0.00 |
Given any dag t representing a fully or partially compressed XML document, we present a method for evaluating any positive unary query expressed in terms of Core XPath axes, on t, without unfolding t into a tree. To each Core XPath query of a certain basic type, we associate a word automaton; these automata run on the graph of dependency between the non-terminals of the straightline regular tree grammar associated to the given dag, or along complete sibling chains in this grammar. Any given Core XPath query can be decomposed into queries of the basic type, and the answer to the query, on the dag t, can then be expressed as a sub-dag of t suitably labeled under the runs of such automata.