Querying Unranked Trees with Stepwise Tree Automata

@inproceedings{Carme2004QueryingUT,
  title={Querying Unranked Trees with Stepwise Tree Automata},
  author={Julien Carme and Joachim Niehren and Marc Tommasi},
  booktitle={RTA},
  year={2004}
}
The problem of selecting nodes in unranked trees is the most basic querying problem for XML. We propose stepwise tree automata for querying unranked trees. Stepwise tree automata can express the same monadic queries as monadic Datalog and monadic second-order logic. We prove this result by reduction to the ranked case, via a new systematic correspondence that relates unranked and ranked queries. 
50 Citations
18 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 18 references

Efficient processing of expressive node-selecting queries on XML data in secondary storage: A tree automata-based approach

  • C. Koch
  • In Proceedings of the International Conference on…
  • 2003
1 Excerpt

Similar Papers

Loading similar papers…