We introduce a controlled form of recursion in XQuery, an inflationary fixed point operator, familiar from the context of relational databases. This operator imposes restrictions on the expressible types of recursion, but it is sufficiently versatile to capture a wide range of interesting use cases, including Regular XPath and its core transitive closure operator. While the optimization of general user-defined recursive functions in XQuery appears elusive, we describe how inflationary fixed points can be efficiently evaluated, provided that the recursive XQuery expressions are distributive. We test distributivity syntactically and algebraically, and provide experimental evidence that XQuery processors can benefit substantially from this mod...
This work may be seen as a further proof of the versatility of the relational database model. Here, ...
We study the problem of maintaining recursively-defined views, such as the transitive closure of a r...
This article studies the complexity of evaluating functional query languages for complex values such...
We introduce a controlled form of recursion in XQuery, an inflationary fixed point operator, familia...
XPath queries are usually translated into an algebra that combines traditional relational operators ...
XQuery is known to be a powerful XML query language with many bells and whistles. For many common qu...
Predicate logic has long been seen as a good foundation for querying relational data. This is embodi...
We present in this paper an approach for XQuery optimization that exploits minimization opportunitie...
Abstract. This paper presents structural recursion as the basis of the syntax and semantics of query...
This master thesis proposes the use of a relational database as special query processor for the XML ...
International audienceGraph databases have received a lot of attention as they are particularly use...
Abstract — XML stream applications bring the challenge of efficiently processing queries on sequenti...
XQuery is a flexible language for querying XML data across a variety of storage methods. This thesis...
We propose a programming paradigm that tries to get close to both the semantic simplicity of relatio...
XQuery is a powerful XML query language with many features and syntactic constructs. For many common...
This work may be seen as a further proof of the versatility of the relational database model. Here, ...
We study the problem of maintaining recursively-defined views, such as the transitive closure of a r...
This article studies the complexity of evaluating functional query languages for complex values such...
We introduce a controlled form of recursion in XQuery, an inflationary fixed point operator, familia...
XPath queries are usually translated into an algebra that combines traditional relational operators ...
XQuery is known to be a powerful XML query language with many bells and whistles. For many common qu...
Predicate logic has long been seen as a good foundation for querying relational data. This is embodi...
We present in this paper an approach for XQuery optimization that exploits minimization opportunitie...
Abstract. This paper presents structural recursion as the basis of the syntax and semantics of query...
This master thesis proposes the use of a relational database as special query processor for the XML ...
International audienceGraph databases have received a lot of attention as they are particularly use...
Abstract — XML stream applications bring the challenge of efficiently processing queries on sequenti...
XQuery is a flexible language for querying XML data across a variety of storage methods. This thesis...
We propose a programming paradigm that tries to get close to both the semantic simplicity of relatio...
XQuery is a powerful XML query language with many features and syntactic constructs. For many common...
This work may be seen as a further proof of the versatility of the relational database model. Here, ...
We study the problem of maintaining recursively-defined views, such as the transitive closure of a r...
This article studies the complexity of evaluating functional query languages for complex values such...