Structural recursion on ordered trees and list-based complex objects: Expressiveness and PTIME restrictions

Abstract

XML query languages need to provide some mechanism to inspect and manipulate nodes at all levels of an input tree. In this paper we investigate the expressive power provided in this regard by structural recursion. 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. Although this restriction is semantical in nature, and therefore undecid-able, we provide an effective syntax. We also give corresponding results for list-based complex objects. © Springer-Verlag Berlin Heidelberg 2007.