CoDE Publications CoDE Publications
IRIDIA Publications IRIDIA Publications
SMG Publications
WIT Publications
WIT Publications
SMG Publications
Home People Research Activities Publications Teaching Resources
By Class By Topic By Year
By Class By Topic By Year
login
E. L. Robertson, L. Saxton, D. Van Gucht, and S. Vansummeren. Structural Recursion as a Query Language on Lists and Ordered Trees. Theory of Computing Systems, 44(4):590-619, 2009.
© Springer-Verlag 2009 – http://dx.doi.org/10.1007/s00224-008-9110-5

Abstract

XML query languages need to provide some mechanism to inspect and manipulate nodes at all levels of an input tree. We investigate the expressive power provided in this regard by structural recursion. In particular, we show that the combination of vertical recursion down a tree combined with horizontal recursion across a list of trees gives rise to a robust class of transformations: it captures the class of all primitive recursive queries. Since queries are expected to be computable in at most polynomial time for all practical purposes, we next identify a restriction of structural recursion that captures the polynomial time queries. We also give corresponding results for list-based complex objects.


Updated: 2017-03-27