W3C

XQuery 1.1

W3C Working Draft 3 December 2008

This version:
http://www.w3.org/TR/2008/WD-xquery-11-20081203/
Latest version:
http://www.w3.org/TR/xquery-11/
Previous version:
http://www.w3.org/TR/2008/WD-xquery-11-20080711/
Editors:
Don Chamberlin (XML Query WG), IBM Almaden Research Center, via http://www.almaden.ibm.com/cs/people/chamberlin/
Jonathan Robie (XML Query WG), Red Hat , via http://www.ibiblio.org/jwrobie/

See also translations.

This document is also available in these non-normative formats: XML.


Abstract

XML is a versatile markup language, capable of labeling the information content of diverse data sources including structured and semi-structured documents, relational databases, and object repositories. A query language that uses the structure of XML intelligently can express queries across all these kinds of data, whether physically stored in XML or viewed as XML via middleware. This specification describes a query language called XQuery, which is designed to be broadly applicable across many types of XML data sources.

XQuery 1.1 is an extended - with a small number of new features - version of the XQuery 1.0 Recommendation published on 23 January 2007. A list of changes made since XQuery 1.0 can be found in J Revision Log.

Status of this Document

This section describes the status of this document at the time of its publication. Other documents may supersede this document. A list of current W3C publications and the latest revision of this technical report can be found in the W3C technical reports index at http://www.w3.org/TR/.

This is a Working Draft as described in the Process Document. It has been developed by the W3C XML Query Working Group, which is part of the XML Activity. The Working Group expects to advance this specification to Recommendation Status.

A considerable number of changes have been made to this document since publication of the First Public Working Draft. Among the most notable of those changes are: simplification (and liberalization) of the syntax of the FLWOR expression; addition of an 'outer for' capability, as well as a 'count' facility, both in the FLWOR expression; addition (finally) of a try-catch facility; and the addition of query prolog syntax to specify the manner in which decimal numbers are formatted.

The WG remains concerned that there are insufficient resources to continue development of the Static Typing feature (defined in the Formal Semantics specification). Individuals who are interested in participating in on-going development of the Formal Semantics are urged to contact the Chair of the XML Query Working Group (whose email address can be found on the XML Query WG public page located at http://www.w3.org/XML/Query/).

No implementation report currently exists. However, a Test Suite for XQuery 1.1 is under development.

This document incorporates changes made against the previous publication of the Working Draft of 11 July 2008. Changes to this document since the previous publication of the Working Draft are detailed in J Revision Log.

Please report errors in this document using W3C's public Bugzilla system (instructions can be found at http://www.w3.org/XML/2005/04/qt-bugzilla). If access to that system is not feasible, you may send your comments to the W3C XSLT/XPath/XQuery public comments mailing list, public-qt-comments@w3.org. It will be very helpful if you include the string “[XQuery11]” in the subject line of your report, whether made in Bugzilla or in email. Please use multiple Bugzilla entries (or, if necessary, multiple email messages) if you have more than one comment to make. Archives of the comments and responses are available at http://lists.w3.org/Archives/Public/public-qt-comments/.

Publication as a Working Draft does not imply endorsement by the W3C Membership. This is a draft document and may be updated, replaced or obsoleted by other documents at any time. It is inappropriate to cite this document as other than work in progress.

This document was produced by a group operating under the 5 February 2004 W3C Patent Policy. W3C maintains a public list of any patent disclosures made in connection with the deliverables of the group; that page also includes instructions for disclosing a patent. An individual who has actual knowledge of a patent which the individual believes contains Essential Claim(s) must disclose the information in accordance with section 6 of the W3C Patent Policy.

Table of Contents

1 Introduction
2 Basics
    2.1 Expression Context
        2.1.1 Static Context
        2.1.2 Dynamic Context
    2.2 Processing Model
        2.2.1 Data Model Generation
        2.2.2 Schema Import Processing
        2.2.3 Expression Processing
            2.2.3.1 Static Analysis Phase
            2.2.3.2 Dynamic Evaluation Phase
        2.2.4 Serialization
        2.2.5 Consistency Constraints
    2.3 Error Handling
        2.3.1 Kinds of Errors
        2.3.2 Identifying and Reporting Errors
        2.3.3 Handling Dynamic Errors
        2.3.4 Errors and Optimization
    2.4 Concepts
        2.4.1 Document Order
        2.4.2 Atomization
        2.4.3 Effective Boolean Value
        2.4.4 Input Sources
        2.4.5 URI Literals
    2.5 Types
        2.5.1 Predefined Schema Types
        2.5.2 Typed Value and String Value
        2.5.3 SequenceType Syntax
        2.5.4 SequenceType Matching
            2.5.4.1 Matching a SequenceType and a Value
            2.5.4.2 Matching an ItemType and an Item
            2.5.4.3 Element Test
            2.5.4.4 Schema Element Test
            2.5.4.5 Attribute Test
            2.5.4.6 Schema Attribute Test
    2.6 Comments
3 Expressions
    3.1 Primary Expressions
        3.1.1 Literals
        3.1.2 Variable References
        3.1.3 Parenthesized Expressions
        3.1.4 Context Item Expression
        3.1.5 Function Calls
    3.2 Path Expressions
        3.2.1 Steps
            3.2.1.1 Axes
            3.2.1.2 Node Tests
        3.2.2 Predicates
        3.2.3 Unabbreviated Syntax
        3.2.4 Abbreviated Syntax
    3.3 Sequence Expressions
        3.3.1 Constructing Sequences
        3.3.2 Filter Expressions
        3.3.3 Combining Node Sequences
    3.4 Arithmetic Expressions
    3.5 Comparison Expressions
        3.5.1 Value Comparisons
        3.5.2 General Comparisons
        3.5.3 Node Comparisons
    3.6 Logical Expressions
    3.7 Constructors
        3.7.1 Direct Element Constructors
            3.7.1.1 Attributes
            3.7.1.2 Namespace Declaration Attributes
            3.7.1.3 Content
            3.7.1.4 Boundary Whitespace
        3.7.2 Other Direct Constructors
        3.7.3 Computed Constructors
            3.7.3.1 Computed Element Constructors
            3.7.3.2 Computed Attribute Constructors
            3.7.3.3 Document Node Constructors
            3.7.3.4 Text Node Constructors
            3.7.3.5 Computed Processing Instruction Constructors
            3.7.3.6 Computed Comment Constructors
            3.7.3.7 Computed Namespace Constructors
        3.7.4 In-scope Namespaces of a Constructed Element
    3.8 FLWOR Expressions
        3.8.1 Variable Bindings
        3.8.2 For Clause
        3.8.3 Let Clause
        3.8.4 Window Clause
            3.8.4.1 Tumbling Windows
            3.8.4.2 Sliding Windows
            3.8.4.3 Effects of Window Clauses on the Tuple Stream
        3.8.5 Where Clause
        3.8.6 Count Clause
        3.8.7 Group By Clause
        3.8.8 Order By Clause
        3.8.9 Return Clause
    3.9 Ordered and Unordered Expressions
    3.10 Conditional Expressions
    3.11 Quantified Expressions
    3.12 Try/Catch Expressions
    3.13 Expressions on SequenceTypes
        3.13.1 Instance Of
        3.13.2 Typeswitch
        3.13.3 Cast
        3.13.4 Castable
        3.13.5 Constructor Functions
        3.13.6 Treat
    3.14 Validate Expressions
    3.15 Extension Expressions
4 Modules and Prologs
    4.1 Version Declaration
    4.2 Module Declaration
    4.3 Boundary-space Declaration
    4.4 Default Collation Declaration
    4.5 Base URI Declaration
    4.6 Construction Declaration
    4.7 Ordering Mode Declaration
    4.8 Empty Order Declaration
    4.9 Copy-Namespaces Declaration
    4.10 Decimal-Format Declaration
    4.11 Schema Import
    4.12 Module Import
    4.13 Namespace Declaration
    4.14 Default Namespace Declaration
    4.15 Variable Declaration
    4.16 Context Item Declaration
    4.17 Function Declaration
    4.18 Option Declaration
5 Conformance
    5.1 Minimal Conformance
    5.2 Optional Features
        5.2.1 Schema Import Feature
        5.2.2 Schema Validation Feature
        5.2.3 Static Typing Feature
            5.2.3.1 Static Typing Extensions
        5.2.4 Full Axis Feature
        5.2.5 Module Feature
        5.2.6 Serialization Feature
    5.3 Data Model Conformance

Appendices

A XQuery 1.1 Grammar
    A.1 EBNF
        A.1.1 Notation
        A.1.2 Extra-grammatical Constraints
        A.1.3 Grammar Notes
    A.2 Lexical structure
        A.2.1 Terminal Symbols
        A.2.2 Terminal Delimitation
        A.2.3 End-of-Line Handling
            A.2.3.1 XML 1.0 End-of-Line Handling
            A.2.3.2 XML 1.1 End-of-Line Handling
        A.2.4 Whitespace Rules
            A.2.4.1 Default Whitespace Handling
            A.2.4.2 Explicit Whitespace Handling
    A.3 Reserved Function Names
    A.4 Precedence Order
B Type Promotion and Operator Mapping
    B.1 Type Promotion
    B.2 Operator Mapping
C Context Components
    C.1 Static Context Components
    C.2 Dynamic Context Components
    C.3 Serialization Parameters
D Implementation-Defined Items
E References
    E.1 Normative References
    E.2 Non-normative References
    E.3 Background Material
F Error Conditions
G The application/xquery Media Type
    G.1 Introduction
    G.2 Registration of MIME Media Type application/xquery
        G.2.1 Interoperability Considerations
        G.2.2 Applications Using this Media Type
        G.2.3 File Extensions
        G.2.4 Intended Usage
        G.2.5 Author/Change Controller
    G.3 Encoding Considerations
    G.4 Recognizing XQuery Files
    G.5 Charset Default Rules
    G.6 Security Considerations
H Glossary (Non-Normative)
I Example Applications (Non-Normative)
    I.1 Joins
    I.2 Queries on Sequence
    I.3 Recursive Transformations
    I.4 Selecting Distinct Combinations
J Revision Log (Non-Normative)


1 Introduction

As increasing amounts of information are stored, exchanged, and presented using XML, the ability to intelligently query XML data sources becomes increasingly important. One of the great strengths of XML is its flexibility in representing many different kinds of information from diverse sources. To exploit this flexibility, an XML query language must provide features for retrieving and interpreting information from these diverse sources.

XQuery is designed to meet the requirements identified by the W3C XML Query Working Group [XML Query 1.0 Requirements] and the use cases in [XML Query Use Cases]. It is designed to be a language in which queries are concise and easily understood. It is also flexible enough to query a broad spectrum of XML information sources, including both databases and documents. The Query Working Group has identified a requirement for both a non-XML query syntax and an XML-based query syntax. XQuery is designed to meet the first of these requirements. XQuery is derived from an XML query language called Quilt [Quilt], which in turn borrowed features from several other languages, including XPath 1.0 [XPath 1.0], XQL [XQL], XML-QL [XML-QL], SQL [SQL], and OQL [ODMG].

[Definition: XQuery 1.1 operates on the abstract, logical structure of an XML document, rather than its surface syntax. This logical structure, known as the data model, is defined in [XQuery/XPath Data Model (XDM)].]

XQuery Version 1.1 is an extension of XPath Version 2.1. Any expression that is syntactically valid and executes successfully in both XPath 2.0 and XQuery 1.0 will return the same result in both languages. Since these languages are so closely related, their grammars and language descriptions are generated from a common source to ensure consistency, and the editors of these specifications work together closely.

XQuery 1.1 also depends on and is closely related to the following specifications:

[Definition: An XQuery 1.1 Processor processes a query according to the XQuery 1.1 specification.]

[Definition: An XQuery 1.0 Processor processes a query according to the XQuery 1.0 specification.]

This document specifies a grammar for XQuery 1.1, using the same basic EBNF notation used in [XML 1.0]. Unless otherwise noted (see A.2 Lexical structure), whitespace is not significant in queries. Grammar productions are introduced together with the features that they describe, and a complete grammar is also presented in the appendix [A XQuery 1.1 Grammar]. The appendix is the normative version.

In the grammar productions in this document, named symbols are underlined and literal text is enclosed in double quotes. For example, the following production describes the syntax of a function call:

[116]    FunctionCall    ::=    QName "(" (ExprSingle ("," ExprSingle)*)? ")"

The production should be read as follows: A function call consists of a QName followed by an open-parenthesis. The open-parenthesis is followed by an optional argument list. The argument list (if present) consists of one or more expressions, separated by commas. The optional argument list is followed by a close-parenthesis.

This document normatively defines the dynamic semantics of XQuery 1.1. The static semantics of XQuery 1.1 are normatively defined in [XQuery 1.0 and XPath 2.0 Formal Semantics]. In this document, examples and material labeled as "Note" are provided for explanatory purposes and are not normative.

Certain aspects of language processing are described in this specification as implementation-defined or implementation-dependent.

2 Basics

The basic building block of XQuery 1.1 is the expression, which is a string of [Unicode] characters (the version of Unicode to be used is implementation-defined.) The language provides several kinds of expressions which may be constructed from keywords, symbols, and operands. In general, the operands of an expression are other expressions. XQuery 1.1 allows expressions to be nested with full generality. (However, unlike a pure functional language, it does not allow variable substitution if the variable declaration contains construction of new nodes.)

Note:

This specification contains no assumptions or requirements regarding the character set encoding of strings of [Unicode] characters.

Like XML, XQuery 1.1 is a case-sensitive language. Keywords in XQuery 1.1 use lower-case characters and are not reserved—that is, names in XQuery 1.1 expressions are allowed to be the same as language keywords, except for certain unprefixed function-names listed in A.3 Reserved Function Names.

[Definition: In the data model, a value is always a sequence.] [Definition: A sequence is an ordered collection of zero or more items.] [Definition: An item is either an atomic value or a node.] [Definition: An atomic value is a value in the value space of an atomic type, as defined in [XML Schema].] [Definition: A node is an instance of one of the node kinds defined in [XQuery/XPath Data Model (XDM)].] Each node has a unique node identity, a typed value, and a string value. In addition, some nodes have a name. The typed value of a node is a sequence of zero or more atomic values. The string value of a node is a value of type xs:string. The name of a node is a value of type xs:QName.

[Definition: A sequence containing exactly one item is called a singleton.] An item is identical to a singleton sequence containing that item. Sequences are never nested—for example, combining the values 1, (2, 3), and ( ) into a single sequence results in the sequence (1, 2, 3). [Definition: A sequence containing zero items is called an empty sequence.]

[Definition: The term XDM instance is used, synonymously with the term value, to denote an unconstrained sequence of nodes and/or atomic values in the data model.]

Names in XQuery 1.1 are called QNames, and conform to the syntax in [XML Names]. [Definition: Lexically, a QName consists of an optional namespace prefix and a local name. If the namespace prefix is present, it is separated from the local name by a colon.] A lexical QName can be converted into an expanded QName by resolving its namespace prefix to a namespace URI, using the statically known namespaces [err:XPST0081]. [Definition: An expanded QName consists of an optional namespace URI and a local name. An expanded QName also retains its original namespace prefix (if any), to facilitate casting the expanded QName into a string.] The namespace URI value is whitespace normalized according to the rules for the xs:anyURI type in [XML Schema]. Two expanded QNames are equal if their namespace URIs are equal and their local names are equal (even if their namespace prefixes are not equal). Namespace URIs and local names are compared on a codepoint basis, without further normalization.

Certain namespace prefixes are predeclared by XQuery and bound to fixed namespace URIs. These namespace prefixes are as follows:

In addition to the prefixes in the above list, this document uses the prefix err to represent the namespace URI http://www.w3.org/2005/xqt-errors (see 2.3.2 Identifying and Reporting Errors). This namespace prefix is not predeclared and its use in this document is not normative.

Element nodes have a property called in-scope namespaces. [Definition: The in-scope namespaces property of an element node is a set of namespace bindings, each of which associates a namespace prefix with a URI, thus defining the set of namespace prefixes that are available for interpreting QNames within the scope of the element. For a given element, one namespace binding may have an empty prefix; the URI of this namespace binding is the default namespace within the scope of the element.]

Note:

In [XPath 1.0], the in-scope namespaces of an element node are represented by a collection of namespace nodes arranged on a namespace axis, which is optional and deprecated in [XPath 2.0]. XQuery does not support the namespace axis and does not represent namespace bindings in the form of nodes. However, where other specifications such as [XSLT 2.0 and XQuery 1.0 Serialization] refer to namespace nodes, these nodes may be synthesized from the in-scope namespaces of an element node by interpreting each namespace binding as a namespace node.

[Definition: Within this specification, the term URI refers to a Universal Resource Identifier as defined in [RFC3986] and extended in [RFC3987] with the new name IRI.] The term URI has been retained in preference to IRI to avoid introducing new names for concepts such as "Base URI" that are defined or referenced across the whole family of XML specifications.

2.1 Expression Context

[Definition: The expression context for a given expression consists of all the information that can affect the result of the expression.] This information is organized into two categories called the static context and the dynamic context.

2.1.1 Static Context

[Definition: The static context of an expression is the information that is available during static analysis of the expression, prior to its evaluation.] This information can be used to decide whether the expression contains a static error. If analysis of an expression relies on some component of the static context that has not been assigned a value, a static error is raised [err:XPST0001].

The individual components of the static context are summarized below. Rules governing the scope and initialization of these components can be found in C.1 Static Context Components.

  • [Definition: XPath 1.0 compatibility mode. This component must be set by all host languages that include XPath 2.0 as a subset, indicating whether rules for compatibility with XPath 1.0 are in effect. XQuery sets the value of this component to false. ]

  • [Definition: Statically known namespaces. This is a set of (prefix, URI) pairs that define all the namespaces that are known during static processing of a given expression.] The URI value is whitespace normalized according to the rules for the xs:anyURI type in [XML Schema]. Note the difference between in-scope namespaces, which is a dynamic property of an element node, and statically known namespaces, which is a static property of an expression.

    Some namespaces are predefined; additional namespaces can be added to the statically known namespaces by namespace declarations in a Prolog and by namespace declaration attributes in direct element constructors.

  • [Definition: Default element/type namespace. This is a namespace URI or "none". The namespace URI, if present, is used for any unprefixed QName appearing in a position where an element or type name is expected.] The URI value is whitespace normalized according to the rules for the xs:anyURI type in [XML Schema].

  • [Definition: Default function namespace. This is a namespace URI or "none". The namespace URI, if present, is used for any unprefixed QName appearing in a position where a function name is expected.] The URI value is whitespace normalized according to the rules for the xs:anyURI type in [XML Schema].

  • [Definition: In-scope schema definitions. This is a generic term for all the element declarations, attribute declarations, and schema type definitions that are in scope during processing of an expression.] It includes the following three parts:

    • [Definition: In-scope schema types. Each schema type definition is identified either by an expanded QName (for a named type) or by an implementation-dependent type identifier (for an anonymous type). The in-scope schema types include the predefined schema types described in 2.5.1 Predefined Schema Types. If the Schema Import Feature is supported, in-scope schema types also include all type definitions found in imported schemas. ]

    • [Definition: In-scope element declarations. Each element declaration is identified either by an expanded QName (for a top-level element declaration) or by an implementation-dependent element identifier (for a local element declaration). If the Schema Import Feature is supported, in-scope element declarations include all element declarations found in imported schemas. ] An element declaration includes information about the element's substitution group affiliation.

      [Definition: Substitution groups are defined in [XML Schema] Part 1, Section 2.2.2.2. Informally, the substitution group headed by a given element (called the head element) consists of the set of elements that can be substituted for the head element without affecting the outcome of schema validation.]

    • [Definition: In-scope attribute declarations. Each attribute declaration is identified either by an expanded QName (for a top-level attribute declaration) or by an implementation-dependent attribute identifier (for a local attribute declaration). If the Schema Import Feature is supported, in-scope attribute declarations include all attribute declarations found in imported schemas. ]

  • [Definition: In-scope variables. This is a set of (expanded QName, type) pairs. It defines the set of variables that are available for reference within an expression. The expanded QName is the name of the variable, and the type is the static type of the variable.]

    Variable declarations in a Prolog are added to in-scope variables. An expression that binds a variable (such as a let, for, some, or every expression) extends the in-scope variables of its subexpressions with the new bound variable and its type. Within a function declaration, the in-scope variables are extended by the names and types of the function parameters.

    The static type of a variable may be either declared in a query or (if the Static Typing Feature is enabled) inferred by static type inference rules as described in [XQuery 1.0 and XPath 2.0 Formal Semantics].

  • [Definition: Context item static type. This component defines the static type of the context item within the scope of a given expression.]

  • [Definition: Function signatures. This component defines the set of functions that are available to be called from within an expression. Each function is uniquely identified by its expanded QName and its arity (number of parameters).] In addition to the name and arity, each function signature specifies the static types of the function parameters and result.

    The function signatures include the signatures of constructor functions, which are discussed in 3.13.5 Constructor Functions.

  • [Definition: Statically known collations. This is an implementation-defined set of (URI, collation) pairs. It defines the names of the collations that are available for use in processing queries and expressions.] [Definition: A collation is a specification of the manner in which strings and URIs are compared and, by extension, ordered. For a more complete definition of collation, see [XQuery 1.0 and XPath 2.0 Functions and Operators].]

  • [Definition: Default collation. This identifies one of the collations in statically known collations as the collation to be used by functions and operators for comparing and ordering values of type xs:string and xs:anyURI (and types derived from them) when no explicit collation is specified.]

  • [Definition: Construction mode. The construction mode governs the behavior of element and document node constructors. If construction mode is preserve, the type of a constructed element node is xs:anyType, and all attribute and element nodes copied during node construction retain their original types. If construction mode is strip, the type of a constructed element node is xs:untyped; all element nodes copied during node construction receive the type xs:untyped, and all attribute nodes copied during node construction receive the type xs:untypedAtomic.]

  • [Definition: Ordering mode. Ordering mode, which has the value ordered or unordered, affects the ordering of the result sequence returned by certain path expressions, FLWOR expressions, and union, intersect, and except expressions.] Details are provided in the descriptions of these expressions.

  • [Definition: Default order for empty sequences. This component controls the processing of empty sequences and NaN values as ordering keys in an order by clause in a FLWOR expression, as described in 3.8.8 Order By Clause.] Its value may be greatest or least.

  • [Definition: Boundary-space policy. This component controls the processing of boundary whitespace by direct element constructors, as described in 3.7.1.4 Boundary Whitespace.] Its value may be preserve or strip.

  • [Definition: Copy-namespaces mode. This component controls the namespace bindings that are assigned when an existing element node is copied by an element constructor, as described in 3.7.1 Direct Element Constructors. Its value consists of two parts: preserve or no-preserve, and inherit or no-inherit.]

  • [Definition: Base URI. This is an absolute URI, used when necessary in the resolution of relative URIs (for example, by the fn:resolve-uri function.)] The URI value is whitespace normalized according to the rules for the xs:anyURI type in [XML Schema].

  • [Definition: Statically known documents. This is a mapping from strings onto types. The string represents the absolute URI of a resource that is potentially available using the fn:doc function. The type is the static type of a call to fn:doc with the given URI as its literal argument. ] If the argument to fn:doc is a string literal that is not present in statically known documents, then the static type of fn:doc is document-node()?.

    Note:

    The purpose of the statically known documents is to provide static type information, not to determine which documents are available. A URI need not be found in the statically known documents to be accessed using fn:doc.

  • [Definition: Statically known collections. This is a mapping from strings onto types. The string represents the absolute URI of a resource that is potentially available using the fn:collection function. The type is the type of the sequence of nodes that would result from calling the fn:collection function with this URI as its argument.] If the argument to fn:collection is a string literal that is not present in statically known collections, then the static type of fn:collection is node()*.

    Note:

    The purpose of the statically known collections is to provide static type information, not to determine which collections are available. A URI need not be found in the statically known collections to be accessed using fn:collection.

  • [Definition: Statically known default collection type. This is the type of the sequence of nodes that would result from calling the fn:collection function with no arguments.] Unless initialized to some other value by an implementation, the value of statically known default collection type is node()*.

  • [Definition: Statically known decimal formats. This is the set of known decimal formats. Each format is used for serializing decimal numbers using fn:format-number().] Each format is identified by a QName, except for the default format, which has no visible name. Each format contains the properties described in the following paragraphs.

    The following properties control the interpretation of characters in the picture string supplied to the fn:format-number function, and also specify characters that may appear in the result of formatting the number. In each case the value must be a single character (see [err:XQST0100]):

    • [Definition: decimal-separator specifies the character used for the decimal-separator-sign; the default value is the period character (.)]

    • [Definition: grouping-separator specifies the character used for the grouping-sign, which is typically used as a thousands separator; the default value is the comma character (,)]

    • [Definition: percent-sign specifies the character used for the percent-sign; the default value is the percent character (%)]

    • [Definition: per-mille-sign specifies the character used for the per-mille-sign; the default value is the Unicode per-mille character (#x2030)]

    • [Definition: zero-digit specifies the character used for the digit-zero-sign; the default value is the digit zero (0). This character must be a digit (category Nd in the Unicode property database), and it must have the numeric value zero. This attribute implicitly defines the Unicode character that is used to represent each of the values 0 to 9 in the final result string: Unicode is organized so that each set of decimal digits forms a contiguous block of characters in numerical sequence.]

    The following attributes control the interpretation of characters in the picture string supplied to the format-number function. In each case the value must be a single character (see [err:XQST0100]).

    • [Definition: digit-sign specifies the character used for the digit-sign in the picture string; the default value is the number sign character (#)]

    • [Definition: pattern-separator-sign specifies the character used for the pattern-separator-sign, which separates positive and negative sub-pictures in a picture string; the default value is the semi-colon character (;)]

    The following attributes specify characters or strings that may appear in the result of formatting the number:

    • [Definition: infinity specifies the string used for the infinity-symbol; the default value is the string Infinity]

    • [Definition: NaN specifies the string used for the NaN-symbol, which is used to represent the value NaN (not-a-number); the default value is the string NaN]

    • [Definition: minus-sign specifies the character used for the minus-symbol; the default value is the hyphen-minus character (-, #x2D). The value must be a single character.]

2.1.2 Dynamic Context

[Definition: The dynamic context of an expression is defined as information that is available at the time the expression is evaluated.] If evaluation of an expression relies on some part of the dynamic context that has not been assigned a value, a dynamic error is raised [err:XPDY0002].

The individual components of the dynamic context are summarized below. Further rules governing the semantics of these components can be found in C.2 Dynamic Context Components.

The dynamic context consists of all the components of the static context, and the additional components listed below.

[Definition: The first three components of the dynamic context (context item, context position, and context size) are called the focus of the expression. ] The focus enables the processor to keep track of which items are being processed by the expression.

Certain language constructs, notably the path expression E1/E2 and the predicate E1[E2], create a new focus for the evaluation of a sub-expression. In these constructs, E2 is evaluated once for each item in the sequence that results from evaluating E1. Each time E2 is evaluated, it is evaluated with a different focus. The focus for evaluating E2 is referred to below as the inner focus, while the focus for evaluating E1 is referred to as the outer focus. The inner focus exists only while E2 is being evaluated. When this evaluation is complete, evaluation of the containing expression continues with its original focus unchanged.

  • [Definition: The context item is the item currently being processed. An item is either an atomic value or a node.] [Definition: When the context item is a node, it can also be referred to as the context node.] The context item is returned by an expression consisting of a single dot (.). When an expression E1/E2 or E1[E2] is evaluated, each item in the sequence obtained by evaluating E1 becomes the context item in the inner focus for an evaluation of E2.

  • [Definition: The context position is the position of the context item within the sequence of items currently being processed.] It changes whenever the context item changes. When the focus is defined, the value of the context position is an integer greater than zero. The context position is returned by the expression fn:position(). When an expression E1/E2 or E1[E2] is evaluated, the context position in the inner focus for an evaluation of E2 is the position of the context item in the sequence obtained by evaluating E1. The position of the first item in a sequence is always 1 (one). The context position is always less than or equal to the context size.

  • [Definition: The context size is the number of items in the sequence of items currently being processed.] Its value is always an integer greater than zero. The context size is returned by the expression fn:last(). When an expression E1/E2 or E1[E2] is evaluated, the context size in the inner focus for an evaluation of E2 is the number of items in the sequence obtained by evaluating E1.

  • [Definition: Variable values. This is a set of (expanded QName, value) pairs. It contains the same expanded QNames as the in-scope variables in the static context for the expression. The expanded QName is the name of the variable and the value is the dynamic value of the variable, which includes its dynamic type.]

  • [Definition: Function implementations. Each function in function signatures has a function implementation that enables the function to map instances of its parameter types into an instance of its result type. For a user-defined function, the function implementation is an XQuery expression. For a built-in function or external function, the function implementation is implementation-dependent. ]

  • [Definition: Current dateTime. This information represents an implementation-dependent point in time during the processing of a query, and includes an explicit timezone. It can be retrieved by the fn:current-dateTime function. If invoked multiple times during the execution of a query, this function always returns the same result.]

  • [Definition: Implicit timezone. This is the timezone to be used when a date, time, or dateTime value that does not have a timezone is used in a comparison or arithmetic operation. The implicit timezone is an implementation-defined value of type xs:dayTimeDuration. See [XML Schema] for the range of legal values of a timezone.]

  • [Definition: Available documents. This is a mapping of strings onto document nodes. The string represents the absolute URI of a resource. The document node is the root of a tree that represents that resource using the data model. The document node is returned by the fn:doc function when applied to that URI.] The set of available documents is not limited to the set of statically known documents, and it may be empty.

    If there are one or more URIs in available documents that map to a document node D, then the document-uri property of D must either be absent, or must be one of these URIs.

    Note:

    This means that given a document node $N, the result of fn:doc(fn:document-uri($N)) is $N will always be True, unless fn:document-uri($N) is an empty sequence.

  • [Definition: Available collections. This is a mapping of strings onto sequences of nodes. The string represents the absolute URI of a resource. The sequence of nodes represents the result of the fn:collection function when that URI is supplied as the argument. ] The set of available collections is not limited to the set of statically known collections, and it may be empty.

    For every document node D that is in the target of a mapping in available collections, or that is the root of a tree containing such a node, the document-uri property of D must either be absent, or must be a URI U such that available documents contains a mapping from U to D."

    Note:

    This means that for any document node $N retrieved using the fn:collection function, either directly or by navigating to the root of a node that was returned, the result of fn:doc(fn:document-uri($N)) is $N will always be True, unless fn:document-uri($N) is an empty sequence. This implies a requirement for the fn:doc and fn:collection functions to be consistent in their effect. If the implementation uses catalogs or user-supplied URI resolvers to dereference URIs supplied to the fn:doc function, the implementation of the fn:collection function must take these mechanisms into account. For example, an implementation might achieve this by mapping the collection URI to a set of document URIs, which are then resolved using the same catalog or URI resolver that is used by the fn:doc function.

  • [Definition: Default collection. This is the sequence of nodes that would result from calling the fn:collection function with no arguments.] The value of default collection may be initialized by the implementation.

2.2 Processing Model

XQuery 1.1 is defined in terms of the data model and the expression context.

Processing Model Overview

Figure 1: Processing Model Overview

Figure 1 provides a schematic overview of the processing steps that are discussed in detail below. Some of these steps are completely outside the domain of XQuery 1.1; in Figure 1, these are depicted outside the line that represents the boundaries of the language, an area labeled external processing. The external processing domain includes generation of an XDM instance that represents the data to be queried (see 2.2.1 Data Model Generation), schema import processing (see 2.2.2 Schema Import Processing) and serialization (see 2.2.4 Serialization). The area inside the boundaries of the language is known as the query processing domain , which includes the static analysis and dynamic evaluation phases (see 2.2.3 Expression Processing). Consistency constraints on the query processing domain are defined in 2.2.5 Consistency Constraints.

2.2.1 Data Model Generation

Before a query can be processed, its input data must be represented as an XDM instance. This process occurs outside the domain of XQuery 1.1, which is why Figure 1 represents it in the external processing domain. Here are some steps by which an XML document might be converted to an XDM instance:

  1. A document may be parsed using an XML parser that generates an XML Information Set (see [XML Infoset]). The parsed document may then be validated against one or more schemas. This process, which is described in [XML Schema], results in an abstract information structure called the Post-Schema Validation Infoset (PSVI). If a document has no associated schema, its Information Set is preserved. (See DM1 in Fig. 1.)

  2. The Information Set or PSVI may be transformed into an XDM instance by a process described in [XQuery/XPath Data Model (XDM)]. (See DM2 in Fig. 1.)

The above steps provide an example of how an XDM instance might be constructed. An XDM instance might also be synthesized directly from a relational database, or constructed in some other way (see DM3 in Fig. 1.) XQuery 1.1 is defined in terms of the data model, but it does not place any constraints on how XDM instances are constructed.

[Definition: Each element node and attribute node in an XDM instance has a type annotation (referred to in [XQuery/XPath Data Model (XDM)] as its type-name property.) The type annotation of a node is a schema type that describes the relationship between the string value of the node and its typed value.] If the XDM instance was derived from a validated XML document as described in Section 3.3 Construction from a PSVIDM, the type annotations of the element and attribute nodes are derived from schema validation. XQuery 1.1 does not provide a way to directly access the type annotation of an element or attribute node.

The value of an attribute is represented directly within the attribute node. An attribute node whose type is unknown (such as might occur in a schemaless document) is given the type annotation xs:untypedAtomic.

The value of an element is represented by the children of the element node, which may include text nodes and other element nodes. The type annotation of an element node indicates how the values in its child text nodes are to be interpreted. An element that has not been validated (such as might occur in a schemaless document) is annotated with the schema type xs:untyped. An element that has been validated and found to be partially valid is annotated with the schema type xs:anyType. If an element node is annotated as xs:untyped, all its descendant element nodes are also annotated as xs:untyped. However, if an element node is annotated as xs:anyType, some of its descendant element nodes may have a more specific type annotation.

2.2.2 Schema Import Processing

The in-scope schema definitions in the static context may be extracted from actual XML schemas as described in [XQuery 1.0 and XPath 2.0 Formal Semantics] (see step SI1 in Figure 1) or may be generated by some other mechanism (see step SI2 in Figure 1). In either case, the result must satisfy the consistency constraints defined in 2.2.5 Consistency Constraints.

2.2.3 Expression Processing

XQuery 1.1 defines two phases of processing called the static analysis phase and the dynamic evaluation phase (see Fig. 1). During the static analysis phase, static errors, dynamic errors, or type errors may be raised. During the dynamic evaluation phase, only dynamic errors or type errors may be raised. These kinds of errors are defined in 2.3.1 Kinds of Errors.

Within each phase, an implementation is free to use any strategy or algorithm whose result conforms to the specifications in this document.

2.2.3.1 Static Analysis Phase

[Definition: The static analysis phase depends on the expression itself and on the static context. The static analysis phase does not depend on input data (other than schemas).]

During the static analysis phase, the query is parsed into an internal representation called the operation tree (step SQ1 in Figure 1). A parse error is raised as a static error [err:XPST0003]. The static context is initialized by the implementation (step SQ2). The static context is then changed and augmented based on information in the prolog (step SQ3). If the Schema Import Feature is supported, the in-scope schema definitions are populated with information from imported schemas. If the Module Feature is supported, the static context is extended with function declarations and variable declarations from imported modules. The static context is used to resolve schema type names, function names, namespace prefixes, and variable names (step SQ4). If a name of one of these kinds in the operation tree is not found in the static context, a static error ([err:XPST0008] or [err:XPST0017]) is raised (however, see exceptions to this rule in 2.5.4.3 Element Test and 2.5.4.5 Attribute Test.)

The operation tree is then normalized by making explicit the implicit operations such as atomization and extraction of Effective Boolean Values (step SQ5). The normalization process is described in [XQuery 1.0 and XPath 2.0 Formal Semantics].

Each expression is then assigned a static type (step SQ6). [Definition: The static type of an expression is a type such that, when the expression is evaluated, the resulting value will always conform to the static type.] If the Static Typing Feature is supported, the static types of various expressions are inferred according to the rules described in [XQuery 1.0 and XPath 2.0 Formal Semantics]. If the Static Typing Feature is not supported, the static types that are assigned are implementation-dependent.

During the static analysis phase, if the Static Typing Feature is in effect and an operand of an expression is found to have a static type that is not appropriate for that operand, a type error is raised [err:XPTY0004]. If static type checking raises no errors and assigns a static type T to an expression, then execution of the expression on valid input data is guaranteed either to produce a value of type T or to raise a dynamic error.

The purpose of the Static Typing Feature is to provide early detection of type errors and to infer type information that may be useful in optimizing the evaluation of an expression.

2.2.3.2 Dynamic Evaluation Phase

[Definition: The dynamic evaluation phase is the phase during which the value of an expression is computed.] It occurs after completion of the static analysis phase.

The dynamic evaluation phase can occur only if no errors were detected during the static analysis phase. If the Static Typing Feature is in effect, all type errors are detected during static analysis and serve to inhibit the dynamic evaluation phase.

The dynamic evaluation phase depends on the operation tree of the expression being evaluated (step DQ1), on the input data (step DQ4), and on the dynamic context (step DQ5), which in turn draws information from the external environment (step DQ3) and the static context (step DQ2). The dynamic evaluation phase may create new data-model values (step DQ4) and it may extend the dynamic context (step DQ5)—for example, by binding values to variables.

[Definition: A dynamic type is associated with each value as it is computed. The dynamic type of a value may be more specific than the static type of the expression that computed it (for example, the static type of an expression might be xs:integer*, denoting a sequence of zero or more integers, but at evaluation time its value may have the dynamic type xs:integer, denoting exactly one integer.)]

If an operand of an expression is found to have a dynamic type that is not appropriate for that operand, a type error is raised [err:XPTY0004].

Even though static typing can catch many type errors before an expression is executed, it is possible for an expression to raise an error during evaluation that was not detected by static analysis. For example, an expression may contain a cast of a string into an integer, which is statically valid. However, if the actual value of the string at run time cannot be cast into an integer, a dynamic error will result. Similarly, an expression may apply an arithmetic operator to a value whose static type is xs:untypedAtomic. This is not a static error, but at run time, if the value cannot be successfully cast to a numeric type, a dynamic error will be raised.

When the Static Typing Feature is in effect, it is also possible for static analysis of an expression to raise a type error, even though execution of the expression on certain inputs would be successful. For example, an expression might contain a function that requires an element as its parameter, and the static analysis phase might infer the static type of the function parameter to be an optional element. This case is treated as a type error and inhibits evaluation, even though the function call would have been successful for input data in which the optional element is present.

2.2.4 Serialization

[Definition: Serialization is the process of converting an XDM instance into a sequence of octets (step DM4 in Figure 1.) ] The general framework for serialization is described in [XSLT 2.0 and XQuery 1.0 Serialization].

An XQuery implementation is not required to provide a serialization interface. For example, an implementation may only provide a DOM interface (see [Document Object Model]) or an interface based on an event stream. In these cases, serialization would be outside of the scope of this specification.

[XSLT 2.0 and XQuery 1.0 Serialization] defines a set of serialization parameters that govern the serialization process. If an XQuery implementation provides a serialization interface, it may support (and may expose to users) any of the serialization parameters listed (with default values) in C.3 Serialization Parameters. An XQuery implementation that provides a serialization interface must support some combination of serialization parameters in which method = "xml" and version = "1.0".

Note:

The data model permits an element node to have fewer in-scope namespaces than its parent. Correct serialization of such an element node would require "undeclaration" of namespaces, which is a feature of [XML Names 1.1]. An implementation that does not support [XML Names 1.1] is permitted to serialize such an element without "undeclaration" of namespaces, which effectively causes the element to inherit the in-scope namespaces of its parent.

2.2.5 Consistency Constraints

In order for XQuery 1.1 to be well defined, the input XDM instance, the static context, and the dynamic context must be mutually consistent. The consistency constraints listed below are prerequisites for correct functioning of an XQuery 1.1 implementation. Enforcement of these consistency constraints is beyond the scope of this specification. This specification does not define the result of a query under any condition in which one or more of these constraints is not satisfied.

Some of the consistency constraints use the term data model schema. [Definition: For a given node in an XDM instance, the data model schema is defined as the schema from which the type annotation of that node was derived.] For a node that was constructed by some process other than schema validation, the data model schema consists simply of the schema type definition that is represented by the type annotation of the node.

2.3 Error Handling

2.3.1 Kinds of Errors

As described in 2.2.3 Expression Processing, XQuery 1.1 defines a static analysis phase, which does not depend on input data, and a dynamic evaluation phase, which does depend on input data. Errors may be raised during each phase.

[Definition: A static error is an error that must be detected during the static analysis phase. A syntax error is an example of a static error.]

[Definition: A dynamic error is an error that must be detected during the dynamic evaluation phase and may be detected during the static analysis phase. Numeric overflow is an example of a dynamic error. ]

[Definition: A type error may be raised during the static analysis phase or the dynamic evaluation phase. During the static analysis phase, a type error occurs when the static type of an expression does not match the expected type of the context in which the expression occurs. During the dynamic evaluation phase, a type error occurs when the dynamic type of a value does not match the expected type of the context in which the value occurs.]

The outcome of the static analysis phase is either success or one or more type errors, static errors, or statically-detected dynamic errors. The result of the dynamic evaluation phase is either a result value, a type error, or a dynamic error.

If more than one error is present, or if an error condition comes within the scope of more than one error defined in this specification, then any non-empty subset of these errors may be reported.

During the static analysis phase, if the Static Typing Feature is in effect and the static type assigned to an expression other than () or data(()) is empty-sequence(), a static error is raised [err:XPST0005]. This catches cases in which a query refers to an element or attribute that is not present in the in-scope schema definitions, possibly because of a spelling error.

Independently of whether the Static Typing Feature is in effect, if an implementation can determine during the static analysis phase that an expression, if evaluated, would necessarily raise a type error or a dynamic error, the implementation may (but is not required to) report that error during the static analysis phase. However, the fn:error() function must not be evaluated during the static analysis phase.

[Definition: In addition to static errors, dynamic errors, and type errors, an XQuery 1.1 implementation may raise warnings, either during the static analysis phase or the dynamic evaluation phase. The circumstances in which warnings are raised, and the ways in which warnings are handled, are implementation-defined.]

In addition to the errors defined in this specification, an implementation may raise a dynamic error for a reason beyond the scope of this specification. For example, limitations may exist on the maximum numbers or sizes of various objects. Any such limitations, and the consequences of exceeding them, are implementation-dependent.

2.3.2 Identifying and Reporting Errors

The errors defined in this specification are identified by QNames that have the form err:XXYYnnnn, where:

  • err denotes the namespace for XPath and XQuery errors, http://www.w3.org/2005/xqt-errors. This binding of the namespace prefix err is used for convenience in this document, and is not normative.

  • XX denotes the language in which the error is defined, using the following encoding:

    • XP denotes an error defined by XPath. Such an error may also occur XQuery since XQuery includes XPath as a subset.

    • XQ denotes an error defined by XQuery.

  • YY denotes the error category, using the following encoding:

    • ST denotes a static error.

    • DY denotes a dynamic error.

    • TY denotes a type error.

  • nnnn is a unique numeric code.

Note:

The namespace URI for XPath and XQuery errors is not expected to change from one version of XQuery 1.1 to another. However, the contents of this namespace may be extended to include additional error definitions.

The method by which an XQuery 1.1 processor reports error information to the external environment is implementation-defined.

An error can be represented by a URI reference that is derived from the error QName as follows: an error with namespace URI NS and local part LP can be represented as the URI reference NS # LP . For example, an error whose QName is err:XPST0017 could be represented as http://www.w3.org/2005/xqt-errors#XPST0017.

Note:

Along with a code identifying an error, implementations may wish to return additional information, such as the location of the error or the processing phase in which it was detected. If an implementation chooses to do so, then the mechanism that it uses to return this information is implementation-defined.

2.3.3 Handling Dynamic Errors

Except as noted in this document, if any operand of an expression raises a dynamic error, the expression also raises a dynamic error. If an expression can validly return a value or raise a dynamic error, the implementation may choose to return the value or raise the dynamic error. For example, the logical expression expr1 and expr2 may return the value false if either operand returns false, or may raise a dynamic error if either operand raises a dynamic error.

If more than one operand of an expression raises an error, the implementation may choose which error is raised by the expression. For example, in this expression:

($x div $y) + xs:decimal($z)

both the sub-expressions ($x div $y) and xs:decimal($z) may raise an error. The implementation may choose which error is raised by the "+" expression. Once one operand raises an error, the implementation is not required, but is permitted, to evaluate any other operands.

[Definition: In addition to its identifying QName, a dynamic error may also carry a descriptive string and one or more additional values called error values.] An implementation may provide a mechanism whereby an application-defined error handler can process error values and produce diagnostic messages.

A dynamic error may be raised by a built-in function or operator. For example, the div operator raises an error if its operands are xs:decimal values and its second operand is equal to zero. Errors raised by built-in functions and operators are defined in [XQuery 1.0 and XPath 2.0 Functions and Operators].

A dynamic error can also be raised explicitly by calling the fn:error function, which only raises an error and never returns a value. This function is defined in [XQuery 1.0 and XPath 2.0 Functions and Operators]. For example, the following function call raises a dynamic error, providing a QName that identifies the error, a descriptive string, and a diagnostic value (assuming that the prefix app is bound to a namespace containing application-defined error codes):

fn:error(xs:QName("app:err057"), "Unexpected value", fn:string($v))

2.3.4 Errors and Optimization

Because different implementations may choose to evaluate or optimize an expression in different ways, certain aspects of the detection and reporting of dynamic errors are implementation-dependent, as described in this section.

An implementation is always free to evaluate the operands of an operator in any order.

In some cases, a processor can determine the result of an expression without accessing all the data that would be implied by the formal expression semantics. For example, the formal description of filter expressions suggests that $s[1] should be evaluated by examining all the items in sequence $s, and selecting all those that satisfy the predicate position()=1. In practice, many implementations will recognize that they can evaluate this expression by taking the first item in the sequence and then exiting. If $s is defined by an expression such as //book[author eq 'Berners-Lee'], then this strategy may avoid a complete scan of a large document and may therefore greatly improve performance. However, a consequence of this strategy is that a dynamic error or type error that would be detected if the expression semantics were followed literally might not be detected at all if the evaluation exits early. In this example, such an error might occur if there is a book element in the input data with more than one author subelement.

The extent to which a processor may optimize its access to data, at the cost of not detecting errors, is defined by the following rules.

Consider an expression Q that has an operand (sub-expression) E. In general the value of E is a sequence. At an intermediate stage during evaluation of the sequence, some of its items will be known and others will be unknown. If, at such an intermediate stage of evaluation, a processor is able to establish that there are only two possible outcomes of evaluating Q, namely the value V or an error, then the processor may deliver the result V without evaluating further items in the operand E. For this purpose, two values are considered to represent the same outcome if their items are pairwise the same, where nodes are the same if they have the same identity, and values are the same if they are equal and have exactly the same type.

There is an exception to this rule: If a processor evaluates an operand E (wholly or in part), then it is required to establish that the actual value of the operand E does not violate any constraints on its cardinality. For example, the expression $e eq 0 results in a type error if the value of $e contains two or more items. A processor is not allowed to decide, after evaluating the first item in the value of $e and finding it equal to zero, that the only possible outcomes are the value true or a type error caused by the cardinality violation. It must establish that the value of $e contains no more than one item.

These rules apply to all the operands of an expression considered in combination: thus if an expression has two operands E1 and E2, it may be evaluated using any samples of the respective sequences that satisfy the above rules.

The rules cascade: if A is an operand of B and B is an operand of C, then the processor needs to evaluate only a sufficient sample of B to determine the value of C, and needs to evaluate only a sufficient sample of A to determine this sample of B.

The effect of these rules is that the processor is free to stop examining further items in a sequence as soon as it can establish that further items would not affect the result except possibly by causing an error. For example, the processor may return true as the result of the expression S1 = S2 as soon as it finds a pair of equal values from the two sequences.

Another consequence of these rules is that where none of the items in a sequence contributes to the result of an expression, the processor is not obliged to evaluate any part of the sequence. Again, however, the processor cannot dispense with a required cardinality check: if an empty sequence is not permitted in the relevant context, then the processor must ensure that the operand is not an empty sequence.

Examples:

  • If an implementation can find (for example, by using an index) that at least one item returned by $expr1 in the following example has the value 47, it is allowed to return true as the result of the some expression, without searching for another item returned by $expr1 that would raise an error if it were evaluated.

    some $x in $expr1 satisfies $x = 47
    
  • In the following example, if an implementation can find (for example, by using an index) the product element-nodes that have an id child with the value 47, it is allowed to return these nodes as the result of the path expression, without searching for another product node that would raise an error because it has an id child whose value is not an integer.

    //product[id = 47]
    

For a variety of reasons, including optimization, implementations may rewrite expressions into a different form. There are a number of rules that limit the extent of this freedom:

  • Other than the raising or not raising of errors, the result of evaluating a rewritten expression must conform to the semantics defined in this specification for the original expression.

    Note:

    This allows an implementation to return a result in cases where the original expression would have raised an error, or to raise an error in cases where the original expression would have returned a result. The main cases where this is likely to arise in practice are (a) where a rewrite changes the order of evaluation, such that a subexpression causing an error is evaluated when the expression is written one way and is not evaluated when the expression is written a different way, and (b) where intermediate results of the evaluation cause overflow or other out-of-range conditions.

    Note:

    This rule does not mean that the result of the expression will always be the same in non-error cases as if it had not been rewritten, because there are many cases where the result of an expression is to some degree implementation-dependent or implementation-defined.

  • Conditional and typeswitch expressions must not raise a dynamic error in respect of subexpressions occurring in a branch that is not selected, and must not return the value delivered by a branch unless that branch is selected. Thus, the following example must not raise a dynamic error if the document abc.xml does not exist:

    if (doc-available('abc.xml')) then doc('abc.xml') else ()
    
  • As stated earlier, an expression must not be rewritten to dispense with a required cardinality check: for example, string-length(//title) must raise an error if the document contains more than one title element.

  • Expressions must not be rewritten in such a way as to create or remove static errors. For example, there is a rule that in casting a string to a QName the operand must be a string literal. This rule applies to the original expression and not to any rewritten form of the expression.

Expression rewrite is illustrated by the following examples.

  • Consider the expression //part[color eq "Red"]. An implementation might choose to rewrite this expression as //part[color = "Red"][color eq "Red"]. The implementation might then process the expression as follows: First process the "=" predicate by probing an index on parts by color to quickly find all the parts that have a Red color; then process the "eq" predicate by checking each of these parts to make sure it has only a single color. The result would be as follows:

    • Parts that have exactly one color that is Red are returned.

    • If some part has color Red together with some other color, an error is raised.

    • The existence of some part that has no color Red but has multiple non-Red colors does not trigger an error.

  • The expression in the following example cannot raise a casting error if it is evaluated exactly as written (i.e., left to right). Since neither predicate depends on the context position, an implementation might choose to reorder the predicates to achieve better performance (for example, by taking advantage of an index). This reordering could cause the expression to raise an error.

    $N[@x castable as xs:date][xs:date(@x) gt xs:date("2000-01-01")]
    

    To avoid unexpected errors caused by expression rewrite, tests that are designed to prevent dynamic errors should be expressed using conditional or typeswitch expressions. For example, the above expression can be written as follows:

    $N[if (@x castable as xs:date)
       then xs:date(@x) gt xs:date("2000-01-01")
       else false()]
    

2.4 Concepts

This section explains some concepts that are important to the processing of XQuery 1.1 expressions.

2.4.1 Document Order

An ordering called document order is defined among all the nodes accessible during processing of a given query, which may consist of one or more trees (documents or fragments). Document order is defined in [XQuery/XPath Data Model (XDM)], and its definition is repeated here for convenience. [Definition: The node ordering that is the reverse of document order is called reverse document order.]

Document order is a total ordering, although the relative order of some nodes is implementation-dependent. [Definition: Informally, document order is the order in which nodes appear in the XML serialization of a document.] [Definition: Document order is stable, which means that the relative order of two nodes will not change during the processing of a given query, even if this order is implementation-dependent.]

Within a tree, document order satisfies the following constraints:

  1. The root node is the first node.

  2. Every node occurs before all of its children and descendants.

  3. Attribute nodes immediately follow the element node with which they are associated. The relative order of attribute nodes is stable but implementation-dependent.

  4. The relative order of siblings is the order in which they occur in the children property of their parent node.

  5. Children and descendants occur before following siblings.

The relative order of nodes in distinct trees is stable but implementation-dependent, subject to the following constraint: If any node in a given tree T1 is before any node in a different tree T2, then all nodes in tree T1 are before all nodes in tree T2.

2.4.2 Atomization

The semantics of some XQuery 1.1 operators depend on a process called atomization. Atomization is applied to a value when the value is used in a context in which a sequence of atomic values is required. The result of atomization is either a sequence of atomic values or a type error [err:FOTY0012]. [Definition: Atomization of a sequence is defined as the result of invoking the fn:data function on the sequence, as defined in [XQuery 1.0 and XPath 2.0 Functions and Operators].]

The semantics of fn:data are repeated here for convenience. The result of fn:data is the sequence of atomic values produced by applying the following rules to each item in the input sequence:

  • If the item is an atomic value, it is returned.

  • If the item is a node, its typed value is returned (err:FOTY0012 is raised if the node has no typed value.)

Atomization is used in processing the following types of expressions:

  • Arithmetic expressions

  • Comparison expressions

  • Function calls and returns

  • Cast expressions

  • Constructor expressions for various kinds of nodes

  • order by clauses in FLWOR expressions

2.4.3 Effective Boolean Value

Under certain circumstances (listed below), it is necessary to find the effective boolean value of a value. [Definition: The effective boolean value of a value is defined as the result of applying the fn:boolean function to the value, as defined in [XQuery 1.0 and XPath 2.0 Functions and Operators].]

The dynamic semantics of fn:boolean are repeated here for convenience:

  1. If its operand is an empty sequence, fn:boolean returns false.

  2. If its operand is a sequence whose first item is a node, fn:boolean returns true.

  3. If its operand is a singleton value of type xs:boolean or derived from xs:boolean, fn:boolean returns the value of its operand unchanged.

  4. If its operand is a singleton value of type xs:string, xs:anyURI, xs:untypedAtomic, or a type derived from one of these, fn:boolean returns false if the operand value has zero length; otherwise it returns true.

  5. If its operand is a singleton value of any numeric type or derived from a numeric type, fn:boolean returns false if the operand value is NaN or is numerically equal to zero; otherwise it returns true.

  6. In all other cases, fn:boolean raises a type error [err:FORG0006].

Note:

The static semantics of fn:boolean are defined in Section 7.2.4 The fn:boolean functionFS.

Note:

The effective boolean value of a sequence that contains at least one node and at least one atomic value may be nondeterministic in regions of a query where ordering mode is unordered.

The effective boolean value of a sequence is computed implicitly during processing of the following types of expressions:

  • Logical expressions (and, or)

  • The fn:not function

  • The where clause of a FLWOR expression

  • Certain types of predicates, such as a[b]

  • Conditional expressions (if)

  • Quantified expressions (some, every)

Note:

The definition of effective boolean value is not used when casting a value to the type xs:boolean, for example in a cast expression or when passing a value to a function whose expected parameter is of type xs:boolean.

2.4.4 Input Sources

XQuery 1.1 has a set of functions that provide access to input data. These functions are of particular importance because they provide a way in which an expression can reference a document or a collection of documents. The input functions are described informally here; they are defined in [XQuery 1.0 and XPath 2.0 Functions and Operators].

An expression can access input data either by calling one of the input functions or by referencing some part of the dynamic context that is initialized by the external environment, such as a variable or context item.

The input functions supported by XQuery 1.1 are as follows:

2.4.5 URI Literals

In certain places in the XQuery grammar, a statically known valid URI is required. These places are denoted by the grammatical symbol URILiteral. For example, URILiterals are used to specify namespaces and collations, both of which must be statically known.

[167]    URILiteral    ::=    StringLiteral

Syntactically, a URILiteral is identical to a StringLiteral: a sequence of zero or more characters enclosed in single or double quotes. However, an implementation MAY raise a static error [err:XQST0046] if the value of a URILiteral is of nonzero length and is not in the lexical space of xs:anyURI.

As in a string literal, any predefined entity reference (such as &), character reference (such as •), or EscapeQuot or EscapeApos (for example, "") is replaced by its appropriate expansion. Certain characters, notably the ampersand, can only be represented using a predefined entity reference or a character reference.

The URILiteral is subjected to whitespace normalization as defined for the xs:anyURI type in [XML Schema]: this means that leading and trailing whitespace is removed, and any other sequence of whitespace characters is replaced by a single space (#x20) character. Whitespace normalization is done after the expansion of character references, so writing a newline (for example) as 
 does not prevent its being normalized to a space character.

The URILiteral is not automatically subjected to percent-encoding or decoding as defined in [RFC3986]. Any process that attempts to resolve the URI against a base URI, or to dereference the URI, may however apply percent-encoding or decoding as defined in the relevant RFCs.

Note:

The xs:anyURI type is designed to anticipate the introduction of Internationalized Resource Identifiers (IRI's) as defined in [RFC3987].

The following is an example of a valid URILiteral:

"http://www.w3.org/2005/xpath-functions/collation/codepoint"

2.5 Types

The type system of XQuery 1.1 is based on [XML Schema], and is formally defined in [XQuery 1.0 and XPath 2.0 Formal Semantics].

[Definition: A sequence type is a type that can be expressed using the SequenceType syntax. Sequence types are used whenever it is necessary to refer to a type in an XQuery 1.1 expression. The term sequence type suggests that this syntax is used to describe the type of an XQuery 1.1 value, which is always a sequence.]

[Definition: A schema type is a type that is (or could be) defined using the facilities of [XML Schema] (including the built-in types of [XML Schema]).] A schema type can be used as a type annotation on an element or attribute node (unless it is a non-instantiable type such as xs:NOTATION or xs:anyAtomicType, in which case its derived types can be so used). Every schema type is either a complex type or a simple type; simple types are further subdivided into list types, union types, and atomic types (see [XML Schema] for definitions and explanations of these terms.)

Atomic types represent the intersection between the categories of sequence type and schema type. An atomic type, such as xs:integer or my:hatsize, is both a sequence type and a schema type.

2.5.1 Predefined Schema Types

The in-scope schema types in the static context are initialized with certain predefined schema types, including the built-in schema types in the namespace http://www.w3.org/2001/XMLSchema, which has the predefined namespace prefix xs. The schema types in this namespace are defined in [XML Schema] and augmented by additional types defined in [XQuery/XPath Data Model (XDM)]. Element and attribute declarations in the xs namespace are not implicitly included in the static context. The schema types defined in [XQuery/XPath Data Model (XDM)] are summarized below.

  1. [Definition: xs:untyped is used as the type annotation of an element node that has not been validated, or has been validated in skip mode.] No predefined schema types are derived from xs:untyped.

  2. [Definition: xs:untypedAtomic is an atomic type that is used to denote untyped atomic data, such as text that has not been assigned a more specific type.] An attribute that has been validated in skip mode is represented in the data model by an attribute node with the type annotation xs:untypedAtomic. No predefined schema types are derived from xs:untypedAtomic.

  3. [Definition: xs:dayTimeDuration is derived by restriction from xs:duration. The lexical representation of xs:dayTimeDuration is restricted to contain only day, hour, minute, and second components.]

  4. [Definition: xs:yearMonthDuration is derived by restriction from xs:duration. The lexical representation of xs:yearMonthDuration is restricted to contain only year and month components.]

  5. [Definition: xs:anyAtomicType is an atomic type that includes all atomic values (and no values that are not atomic). Its base type is xs:anySimpleType from which all simple types, including atomic, list, and union types, are derived. All primitive atomic types, such as xs:decimal and xs:string, have xs:anyAtomicType as their base type.]

    Note:

    xs:anyAtomicType will not appear as the type of an actual value in an XDM instance.

The relationships among the schema types in the xs namespace are illustrated in Figure 2. A more complete description of the XQuery 1.1 type hierarchy can be found in [XQuery 1.0 and XPath 2.0 Functions and Operators].

Type Hierarchy Diagram

Figure 2: Hierarchy of Schema Types used in XQuery 1.1

2.5.2 Typed Value and String Value

Every node has a typed value and a string value. [Definition: The typed value of a node is a sequence of atomic values and can be extracted by applying the fn:data function to the node.] [Definition: The string value of a node is a string and can be extracted by applying the fn:string function to the node.] Definitions of fn:data and fn:string can be found in [XQuery 1.0 and XPath 2.0 Functions and Operators].

An implementation may store both the typed value and the string value of a node, or it may store only one of these and derive the other as needed. The string value of a node must be a valid lexical representation of the typed value of the node, but the node is not required to preserve the string representation from the original source document. For example, if the typed value of a node is the xs:integer value 30, its string value might be "30" or "0030".

The typed value, string value, and type annotation of a node are closely related, and are defined by rules found in the following locations:

As a convenience to the reader, the relationship between typed value and string value for various kinds of nodes is summarized and illustrated by examples below.

  1. For text and document nodes, the typed value of the node is the same as its string value, as an instance of the type xs:untypedAtomic. The string value of a document node is formed by concatenating the string values of all its descendant text nodes, in document order.

  2. The typed value of a comment or processing instruction node is the same as its string value. It is an instance of the type xs:string.

  3. The typed value of an attribute node with the type annotation xs:anySimpleType or xs:untypedAtomic is the same as its string value, as an instance of xs:untypedAtomic. The typed value of an attribute node with any other type annotation is derived from its string value and type annotation using the lexical-to-value-space mapping defined in [XML Schema] Part 2 for the relevant type.

    Example: A1 is an attribute having string value "3.14E-2" and type annotation xs:double. The typed value of A1 is the xs:double value whose lexical representation is 3.14E-2.

    Example: A2 is an attribute with type annotation xs:IDREFS, which is a list datatype whose item type is the atomic datatype xs:IDREF. Its string value is "bar baz faz". The typed value of A2 is a sequence of three atomic values ("bar", "baz", "faz"), each of type xs:IDREF. The typed value of a node is never treated as an instance of a named list type. Instead, if the type annotation of a node is a list type (such as xs:IDREFS), its typed value is treated as a sequence of the atomic type from which it is derived (such as xs:IDREF).

  4. For an element node, the relationship between typed value and string value depends on the node's type annotation, as follows:

    1. If the type annotation is xs:untyped or xs:anySimpleType or denotes a complex type with mixed content (including xs:anyType), then the typed value of the node is equal to its string value, as an instance of xs:untypedAtomic. However, if the nilled property of the node is true, then its typed value is the empty sequence.

      Example: E1 is an element node having type annotation xs:untyped and string value "1999-05-31". The typed value of E1 is "1999-05-31", as an instance of xs:untypedAtomic.

      Example: E2 is an element node with the type annotation formula, which is a complex type with mixed content. The content of E2 consists of the character "H", a child element named subscript with string value "2", and the character "O". The typed value of E2 is "H2O" as an instance of xs:untypedAtomic.

    2. If the type annotation denotes a simple type or a complex type with simple content, then the typed value of the node is derived from its string value and its type annotation in a way that is consistent with schema validation. However, if the nilled property of the node is true, then its typed value is the empty sequence.

      Example: E3 is an element node with the type annotation cost, which is a complex type that has several attributes and a simple content type of xs:decimal. The string value of E3 is "74.95". The typed value of E3 is 74.95, as an instance of xs:decimal.

      Example: E4 is an element node with the type annotation hatsizelist, which is a simple type derived from the atomic type hatsize, which in turn is derived from xs:integer. The string value of E4 is "7 8 9". The typed value of E4 is a sequence of three values (7, 8, 9), each of type hatsize.

      Example: E5 is an element node with the type annotation my:integer-or-string which is a union type with member types xs:integer and xs:string. The string value of E5 is "47". The typed value of E5 is 47 as an xs:integer, since xs:integer is the member type that validated the content of E5. In general, when the type annotation of a node is a union type, the typed value of the node will be an instance of one of the member types of the union.

      Note:

      If an implementation stores only the string value of a node, and the type annotation of the node is a union type, the implementation must be able to deliver the typed value of the node as an instance of the appropriate member type.

    3. If the type annotation denotes a complex type with empty content, then the typed value of the node is the empty sequence and its string value is the zero-length string.

    4. If the type annotation denotes a complex type with element-only content, then the typed value of the node is undefined. The fn:data function raises a type error [err:FOTY0012] when applied to such a node. The string value of such a node is equal to the concatenated string values of all its text node descendants, in document order.

      Example: E6 is an element node with the type annotation weather, which is a complex type whose content type specifies element-only. E6 has two child elements named temperature and precipitation. The typed value of E6 is undefined, and the fn:data function applied to E6 raises an error.

2.5.3 SequenceType Syntax

Whenever it is necessary to refer to a type in an XQuery 1.1 expression, the SequenceType syntax is used.

[145]    SequenceType    ::=    ("empty-sequence" "(" ")")
| (ItemType OccurrenceIndicator?)
[147]    ItemType    ::=    KindTest | ("item" "(" ")") | AtomicType
[146]    OccurrenceIndicator    ::=    "?" | "*" | "+"
[148]    AtomicType    ::=    QName
[149]    KindTest    ::=    DocumentTest
| ElementTest
| AttributeTest
| SchemaElementTest
| SchemaAttributeTest
| PITest
| CommentTest
| TextTest
| AnyKindTest
[151]    DocumentTest    ::=    "document-node" "(" (ElementTest | SchemaElementTest)? ")"
[160]    ElementTest    ::=    "element" "(" (ElementNameOrWildcard ("," TypeName "?"?)?)? ")"
[162]    SchemaElementTest    ::=    "schema-element" "(" ElementDeclaration ")"
[163]    ElementDeclaration    ::=    ElementName
[156]    AttributeTest    ::=    "attribute" "(" (AttribNameOrWildcard ("," TypeName)?)? ")"
[158]    SchemaAttributeTest    ::=    "schema-attribute" "(" AttributeDeclaration ")"
[159]    AttributeDeclaration    ::=    AttributeName
[161]    ElementNameOrWildcard    ::=    ElementName | "*"
[165]    ElementName    ::=    QName
[157]    AttribNameOrWildcard    ::=    AttributeName | "*"
[164]    AttributeName    ::=    QName
[166]    TypeName    ::=    QName
[155]    PITest    ::=    "processing-instruction" "(" (NCName | StringLiteral)? ")"
[153]    CommentTest    ::=    "comment" "(" ")"
[152]    TextTest    ::=    "text" "(" ")"
[150]    AnyKindTest    ::=    "node" "(" ")"

With the exception of the special type empty-sequence(), a sequence type consists of an item type that constrains the type of each item in the sequence, and a cardinality that constrains the number of items in the sequence. Apart from the item type item(), which permits any kind of item, item types divide into node types (such as element()) and atomic types (such as xs:integer).

Item types representing element and attribute nodes may specify the required type annotations of those nodes, in the form of a schema type. Thus the item type element(*, us:address) denotes any element node whose type annotation is (or is derived from) the schema type named us:address.

Here are some examples of sequence types that might be used in XQuery 1.1 expressions:

  • xs:date refers to the built-in atomic schema type named xs:date

  • attribute()? refers to an optional attribute node

  • element() refers to any element node

  • element(po:shipto, po:address) refers to an element node that has the name po:shipto and has the type annotation po:address (or a schema type derived from po:address)

  • element(*, po:address) refers to an element node of any name that has the type annotation po:address (or a type derived from po:address)

  • element(customer) refers to an element node named customer with any type annotation

  • schema-element(customer) refers to an element node whose name is customer (or is in the substitution group headed by customer) and whose type annotation matches the schema type declared for a customer element in the in-scope element declarations

  • node()* refers to a sequence of zero or more nodes of any kind

  • item()+ refers to a sequence of one or more nodes or atomic values

2.5.4 SequenceType Matching

[Definition: During evaluation of an expression, it is sometimes necessary to determine whether a value with a known dynamic type "matches" an expected sequence type. This process is known as SequenceType matching.] For example, an instance of expression returns true if the dynamic type of a given value matches a given sequence type, or false if it does not.

QNames appearing in a sequence type have their prefixes expanded to namespace URIs by means of the statically known namespaces and (where applicable) the default element/type namespace. An unprefixed attribute QName is in no namespace. Equality of QNames is defined by the eq operator.

The rules for SequenceType matching compare the dynamic type of a value with an expected sequence type. These rules are a subset of the formal rules that match a value with an expected type defined in [XQuery 1.0 and XPath 2.0 Formal Semantics], because the Formal Semantics must be able to match values against types that are not expressible using the SequenceType syntax.

Some of the rules for SequenceType matching require determining whether a given schema type is the same as or derived from an expected schema type. The given schema type may be "known" (defined in the in-scope schema definitions), or "unknown" (not defined in the in-scope schema definitions). An unknown schema type might be encountered, for example, if a source document has been validated using a schema that was not imported into the static context. In this case, an implementation is allowed (but is not required) to provide an implementation-dependent mechanism for determining whether the unknown schema type is derived from the expected schema type. For example, an implementation might maintain a data dictionary containing information about type hierarchies.

[Definition: The use of a value whose dynamic type is derived from an expected type is known as subtype substitution.] Subtype substitution does not change the actual type of a value. For example, if an xs:integer value is used where an xs:decimal value is expected, the value retains its type as xs:integer.

The definition of SequenceType matching relies on a pseudo-function named derives-from( AT, ET ), which takes an actual simple or complex schema type AT and an expected simple or complex schema type ET, and either returns a boolean value or raises a type error [err:XPTY0004]. The pseudo-function derives-from is defined below and is defined formally in [XQuery 1.0 and XPath 2.0 Formal Semantics].

  • derives-from( AT, ET ) returns true if ET is a known type and any of the following three conditions is true:

    1. AT is a schema type found in the in-scope schema definitions, and is the same as ET or is derived by restriction or extension from ET

    2. AT is a schema type not found in the in-scope schema definitions, and an implementation-dependent mechanism is able to determine that AT is derived by restriction from ET

    3. There exists some schema type IT such that derives-from( IT, ET ) and derives-from( AT, IT ) are true.

  • derives-from( AT, ET ) returns false if ET is a known type and either the first and third or the second and third of the following conditions are true:

    1. AT is a schema type found in the in-scope schema definitions, and is not the same as ET, and is not derived by restriction or extension from ET

    2. AT is a schema type not found in the in-scope schema definitions, and an implementation-dependent mechanism is able to determine that AT is not derived by restriction from ET

    3. No schema type IT exists such that derives-from( IT, ET ) and derives-from( AT, IT ) are true.

  • derives-from( AT, ET ) raises a type error [err:XPTY0004] if:

    1. ET is an unknown type, or

    2. AT is an unknown type, and the implementation is not able to determine whether AT is derived by restriction from ET.

Note:

The derives-from pseudo-function cannot be written as a real XQuery function, because types are not valid function parameters.

The rules for SequenceType matching are given below, with examples (the examples are for purposes of illustration, and do not cover all possible cases).

2.5.4.1 Matching a SequenceType and a Value

An OccurrenceIndicator specifies the number of items in a sequence, as follows:

  • ? matches zero or one items

  • * matches zero or more items

  • + matches one or more items

As a consequence of these rules, any sequence type whose OccurrenceIndicator is * or ? matches a value that is an empty sequence.

2.5.4.2 Matching an ItemType and an Item
  • An ItemType consisting simply of a QName is interpreted as an AtomicType. An AtomicType AtomicType matches an atomic value whose actual type is AT if derives-from( AT, AtomicType ) is true. If a QName that is used as an AtomicType is not defined as an atomic type in the in-scope schema types, a static error is raised [err:XPST0051].

    Example: The AtomicType xs:decimal matches the value 12.34 (a decimal literal). xs:decimal also matches a value whose type is shoesize, if shoesize is an atomic type derived by restriction from xs:decimal.

    Note:

    The names of non-atomic types such as xs:IDREFS are not accepted in this context, but can often be replaced by an atomic type with an occurrence indicator, such as xs:IDREF+.

  • item() matches any single item.

    Example: item() matches the atomic value 1 or the element <a/>.

  • node() matches any node.

  • text() matches any text node.

  • processing-instruction() matches any processing-instruction node.

  • processing-instruction( N ) matches any processing-instruction node whose name (called its "PITarget" in XML) is equal to N, where N is an NCName.

    Example: processing-instruction(xml-stylesheet) matches any processing instruction whose PITarget is xml-stylesheet.

    For backward compatibility with XPath 1.0, the PITarget of a processing instruction may also be expressed as a string literal, as in this example: processing-instruction("xml-stylesheet").

    If the specified PITarget is not a syntactically valid NCName, a type error is raised [err:XPTY0004].

  • comment() matches any comment node.

  • namespace-node() matches any namespace node.

  • document-node() matches any document node.

  • document-node( E ) matches any document node that contains exactly one element node, optionally accompanied by one or more comment and processing instruction nodes, if E is an ElementTest or SchemaElementTest that matches the element node (see 2.5.4.3 Element Test and 2.5.4.4 Schema Element Test).

    Example: document-node(element(book)) matches a document node containing exactly one element node that is matched by the ElementTest element(book).

  • An ItemType that is an ElementTest, SchemaElementTest, AttributeTest, or SchemaAttributeTest matches an element or attribute node as described in the following sections.

2.5.4.3 Element Test

An ElementTest is used to match an element node by its name and/or type annotation. An ElementTest may take any of the following forms. In these forms, ElementName need not be present in the in-scope element declarations, but TypeName must be present in the in-scope schema types [err:XPST0008]. Note that substitution groups do not affect the semantics of ElementTest.

  1. element() and element(*) match any single element node, regardless of its name or type annotation.

  2. element( ElementName ) matches any element node whose name is ElementName, regardless of its type annotation or nilled property.

    Example: element(person) matches any element node whose name is person.

  3. element( ElementName , TypeName ) matches an element node whose name is ElementName if derives-from( AT, TypeName ) is true, where AT is the type annotation of the element node, and the nilled property of the node is false.

    Example: element(person, surgeon) matches a non-nilled element node whose name is person and whose type annotation is surgeon (or is derived from surgeon).

  4. element( ElementName, TypeName ?) matches an element node whose name is ElementName if derives-from( AT, TypeName ) is true, where AT is the type annotation of the element node. The nilled property of the node may be either true or false.

    Example: element(person, surgeon?) matches a nilled or non-nilled element node whose name is person and whose type annotation is surgeon (or is derived from surgeon).

  5. element(*, TypeName ) matches an element node regardless of its name, if derives-from( AT, TypeName ) is true, where AT is the type annotation of the element node, and the nilled property of the node is false.

    Example: element(*, surgeon) matches any non-nilled element node whose type annotation is surgeon (or is derived from surgeon), regardless of its name.

  6. element(*, TypeName ?) matches an element node regardless of its name, if derives-from( AT, TypeName ) is true, where AT is the type annotation of the element node. The nilled property of the node may be either true or false.

    Example: element(*, surgeon?) matches any nilled or non-nilled element node whose type annotation is surgeon (or is derived from surgeon), regardless of its name.

2.5.4.4 Schema Element Test

A SchemaElementTest matches an element node against a corresponding element declaration found in the in-scope element declarations. It takes the following form:

schema-element( ElementName )

If the ElementName specified in the SchemaElementTest is not found in the in-scope element declarations, a static error is raised [err:XPST0008].

A SchemaElementTest matches a candidate element node if all three of the following conditions are satisfied:

  1. The name of the candidate node matches the specified ElementName or matches the name of an element in a substitution group headed by an element named ElementName.

  2. derives-from( AT, ET ) is true, where AT is the type annotation of the candidate node and ET is the schema type declared for element ElementName in the in-scope element declarations.

  3. If the element declaration for ElementName in the in-scope element declarations is not nillable, then the nilled property of the candidate node is false.

Example: The SchemaElementTest schema-element(customer) matches a candidate element node if customer is a top-level element declaration in the in-scope element declarations, the name of the candidate node is customer or is in a substitution group headed by customer, the type annotation of the candidate node is the same as or derived from the schema type declared for the customer element, and either the candidate node is not nilled or customer is declared to be nillable.

2.5.4.5 Attribute Test

An AttributeTest is used to match an attribute node by its name and/or type annotation. An AttributeTest any take any of the following forms. In these forms, AttributeName need not be present in the in-scope attribute declarations, but TypeName must be present in the in-scope schema types [err:XPST0008].

  1. attribute() and attribute(*) match any single attribute node, regardless of its name or type annotation.

  2. attribute( AttributeName ) matches any attribute node whose name is AttributeName, regardless of its type annotation.

    Example: attribute(price) matches any attribute node whose name is price.

  3. attribute( AttributeName, TypeName ) matches an attribute node whose name is AttributeName if derives-from( AT, TypeName ) is true, where AT is the type annotation of the attribute node.

    Example: attribute(price, currency) matches an attribute node whose name is price and whose type annotation is currency (or is derived from currency).

  4. attribute(*, TypeName ) matches an attribute node regardless of its name, if derives-from( AT, TypeName ) is true, where AT is the type annotation of the attribute node.

    Example: attribute(*, currency) matches any attribute node whose type annotation is currency (or is derived from currency), regardless of its name.

2.5.4.6 Schema Attribute Test

A SchemaAttributeTest matches an attribute node against a corresponding attribute declaration found in the in-scope attribute declarations. It takes the following form:

schema-attribute( AttributeName )

If the AttributeName specified in the SchemaAttributeTest is not found in the in-scope attribute declarations, a static error is raised [err:XPST0008].

A SchemaAttributeTest matches a candidate attribute node if both of the following conditions are satisfied:

  1. The name of the candidate node matches the specified AttributeName.

  2. derives-from( AT, ET ) is true, where AT is the type annotation of the candidate node and ET is the schema type declared for attribute AttributeName in the in-scope attribute declarations.

Example: The SchemaAttributeTest schema-attribute(color) matches a candidate attribute node if color is a top-level attribute declaration in the in-scope attribute declarations, the name of the candidate node is color, and the type annotation of the candidate node is the same as or derived from the schema type declared for the color attribute.

2.6 Comments

[188]    Comment    ::=    "(:" (CommentContents | Comment)* ":)"
[196]    CommentContents    ::=    (Char+ - (Char* ('(:' | ':)') Char*))

Comments may be used to provide informative annotation for a query, either in the Prolog or in the Query Body . Comments are lexical constructs only, and do not affect query processing.

Comments are strings, delimited by the symbols (: and :). Comments may be nested.

A comment may be used anywhere ignorable whitespace is allowed (see A.2.4.1 Default Whitespace Handling).

The following is an example of a comment:

(: Houston, we have a problem :)

3 Expressions

This section discusses each of the basic kinds of expression. Each kind of expression has a name such as PathExpr, which is introduced on the left side of the grammar production that defines the expression. Since XQuery 1.1 is a composable language, each kind of expression is defined in terms of other expressions whose operators have a higher precedence. In this way, the precedence of operators is represented explicitly in the grammar.

The order in which expressions are discussed in this document does not reflect the order of operator precedence. In general, this document introduces the simplest kinds of expressions first, followed by more complex expressions. For the complete grammar, see Appendix [A XQuery 1.1 Grammar].

[Definition: A query consists of one or more modules.] If a query is executable, one of its modules has a Query Body containing an expression whose value is the result of the query. An expression is represented in the XQuery grammar by the symbol Expr.

[38]    Expr    ::=    ExprSingle ("," ExprSingle)*
[39]    ExprSingle    ::=    FLWORExpr
| QuantifiedExpr
| TypeswitchExpr
| IfExpr
| TryCatchExpr
| OrExpr

The XQuery 1.1 operator that has lowest precedence is the comma operator, which is used to combine two operands to form a sequence. As shown in the grammar, a general expression (Expr) can consist of multiple ExprSingle operands, separated by commas. The name ExprSingle denotes an expression that does not contain a top-level comma operator (despite its name, an ExprSingle may evaluate to a sequence containing more than one item.)

The symbol ExprSingle is used in various places in the grammar where an expression is not allowed to contain a top-level comma. For example, each of the arguments of a function call must be an ExprSingle, because commas are used to separate the arguments of a function call.

After the comma, the expressions that have next lowest precedence are FLWORExpr, QuantifiedExpr, TypeswitchExpr, IfExpr, and OrExpr. Each of these expressions is described in a separate section of this document.

3.1 Primary Expressions

[Definition: Primary expressions are the basic primitives of the language. They include literals, variable references, context item expressions, constructors, and function calls. A primary expression may also be created by enclosing any expression in parentheses, which is sometimes helpful in controlling the precedence of operators.] Constructors are described in 3.7 Constructors.

[107]    PrimaryExpr    ::=    Literal | VarRef | ParenthesizedExpr | ContextItemExpr | FunctionCall | OrderedExpr | UnorderedExpr | Constructor

3.1.1 Literals

[Definition: A literal is a direct syntactic representation of an atomic value.] XQuery 1.1 supports two kinds of literals: numeric literals and string literals.

[108]    Literal    ::=    NumericLiteral | StringLiteral
[109]    NumericLiteral    ::=    IntegerLiteral | DecimalLiteral | DoubleLiteral
[178]    IntegerLiteral    ::=    Digits
[179]    DecimalLiteral    ::=    ("." Digits) | (Digits "." [0-9]*)
[180]    DoubleLiteral    ::=    (("." Digits) | (Digits ("." [0-9]*)?)) [eE] [+-]? Digits
[181]    StringLiteral    ::=    ('"' (PredefinedEntityRef | CharRef | EscapeQuot | [^"&])* '"') | ("'" (PredefinedEntityRef | CharRef | EscapeApos | [^'&])* "'")
[182]    PredefinedEntityRef    ::=    "&" ("lt" | "gt" | "amp" | "quot" | "apos") ";"
[195]    Digits    ::=    [0-9]+

The value of a numeric literal containing no "." and no e or E character is an atomic value of type xs:integer. The value of a numeric literal containing "." but no e or E character is an atomic value of type xs:decimal. The value of a numeric literal containing an e or E character is an atomic value of type xs:double. The value of the numeric literal is determined by casting it to the appropriate type according to the rules for casting from xs:untypedAtomic to a numeric type as specified in Section 17.1.1 Casting from xs:string and xs:untypedAtomicFO.

The value of a string literal is an atomic value whose type is xs:string and whose value is the string denoted by the characters between the delimiting apostrophes or quotation marks. If the literal is delimited by apostrophes, two adjacent apostrophes within the literal are interpreted as a single apostrophe. Similarly, if the literal is delimited by quotation marks, two adjacent quotation marks within the literal are interpreted as one quotation mark.

A string literal may contain a predefined entity reference. [Definition: A predefined entity reference is a short sequence of characters, beginning with an ampersand, that represents a single character that might otherwise have syntactic significance.] Each predefined entity reference is replaced by the character it represents when the string literal is processed. The predefined entity references recognized by XQuery are as follows:

Entity Reference Character Represented
&lt; <
&gt; >
&amp; &
&quot; "
&apos; '

A string literal may also contain a character reference. [Definition: A character reference is an XML-style reference to a [Unicode] character, identified by its decimal or hexadecimal code point.] For example, the Euro symbol (€) can be represented by the character reference &#8364;. Character references are normatively defined in Section 4.1 of the XML specification (it is implementation-defined whether the rules in [XML 1.0] or [XML 1.1] apply.) A static error [err:XQST0090] is raised if a character reference does not identify a valid character in the version of XML that is in use.

Here are some examples of literal expressions:

  • "12.5" denotes the string containing the characters '1', '2', '.', and '5'.

  • 12 denotes the xs:integer value twelve.

  • 12.5 denotes the xs:decimal value twelve and one half.

  • 125E2 denotes the xs:double value twelve thousand, five hundred.

  • "He said, ""I don't like it.""" denotes a string containing two quotation marks and one apostrophe.

  • "Ben &amp; Jerry&apos;s" denotes the xs:string value "Ben & Jerry's".

  • "&#8364;99.50" denotes the xs:string value "€99.50".

The xs:boolean values true and false can be represented by calls to the built-in functions fn:true() and fn:false(), respectively.

Values of other atomic types can be constructed by calling the constructor function for the given type. The constructor functions for XML Schema built-in types are defined in [XQuery 1.0 and XPath 2.0 Functions and Operators]. In general, the name of a constructor function for a given type is the same as the name of the type (including its namespace). For example:

  • xs:integer("12") returns the integer value twelve.

  • xs:date("2001-08-25") returns an item whose type is xs:date and whose value represents the date 25th August 2001.

  • xs:dayTimeDuration("PT5H") returns an item whose type is xs:dayTimeDuration and whose value represents a duration of five hours.

Constructor functions can also be used to create special values that have no literal representation, as in the following examples:

  • xs:float("NaN") returns the special floating-point value, "Not a Number."

  • xs:double("INF") returns the special double-precision value, "positive infinity."

It is also possible to construct values of various types by using a cast expression. For example:

  • 9 cast as hatsize returns the atomic value 9 whose type is hatsize.

3.1.2 Variable References

[110]    VarRef    ::=    "$" VarName
[111]    VarName    ::=    QName

[Definition: A variable reference is a QName preceded by a $-sign.] Two variable references are equivalent if their local names are the same and their namespace prefixes are bound to the same namespace URI in the statically known namespaces. An unprefixed variable reference is in no namespace.

Every variable reference must match a name in the in-scope variables, which include variables from the following sources:

  1. A variable may be declared in a Prolog, in the current module or an imported module. See 4 Modules and Prologs for a discussion of modules and Prologs.

  2. The in-scope variables may be augmented by implementation-defined variables.

  3. A variable may be bound by an XQuery 1.1 expression. The kinds of expressions that can bind variables are FLWOR expressions (3.8 FLWOR Expressions), quantified expressions (3.11 Quantified Expressions), and typeswitch expressions (3.13.2 Typeswitch). Function calls also bind values to the formal parameters of functions before executing the function body.

Every variable binding has a static scope. The scope defines where references to the variable can validly occur. It is a static error [err:XPST0008] to reference a variable that is not in scope. If a variable is bound in the static context for an expression, that variable is in scope for the entire expression.

A reference to a variable that was declared external, but was not bound to a value by the external environment, raises a dynamic error [err:XPDY0002].

If a variable reference matches two or more variable bindings that are in scope, then the reference is taken as referring to the inner binding, that is, the one whose scope is smaller. At evaluation time, the value of a variable reference is the value of the expression to which the relevant variable is bound. The scope of a variable binding is defined separately for each kind of expression that can bind variables.

3.1.3 Parenthesized Expressions

[112]    ParenthesizedExpr    ::=    "(" Expr? ")"

Parentheses may be used to enforce a particular evaluation order in expressions that contain multiple operators. For example, the expression (2 + 4) * 5 evaluates to thirty, since the parenthesized expression (2 + 4) is evaluated first and its result is multiplied by five. Without parentheses, the expression 2 + 4 * 5 evaluates to twenty-two, because the multiplication operator has higher precedence than the addition operator.

Empty parentheses are used to denote an empty sequence, as described in 3.3.1 Constructing Sequences.

3.1.4 Context Item Expression

[113]    ContextItemExpr    ::=    "."

A context item expression evaluates to the context item, which may be either a node (as in the expression fn:doc("bib.xml")/books/book[fn:count(./author)>1]) or an atomic value (as in the expression (1 to 100)[. mod 5 eq 0]).

If the context item is undefined, a context item expression raises a dynamic error [err:XPDY0002].

3.1.5 Function Calls

[Definition: The built-in functions supported by XQuery 1.1 are defined in [XQuery 1.0 and XPath 2.0 Functions and Operators].] Additional functions may be declared in a Prolog, imported from a library module, or provided by the external environment as part of the static context.

[116]    FunctionCall    ::=    QName "(" (ExprSingle ("," ExprSingle)*)? ")"

A function call consists of a QName followed by a parenthesized list of zero or more expressions, called arguments. If the QName in the function call has no namespace prefix, it is considered to be in the default function namespace.

If the expanded QName and number of arguments in a function call do not match the name and arity of a function signature in the static context, a static error is raised [err:XPST0017].

A function call is evaluated as follows:

  1. Argument expressions are evaluated, producing argument values. The order of argument evaluation is implementation-dependent and a function need not evaluate an argument if the function can evaluate its body without evaluating that argument.

  2. Each argument value is converted by applying the function conversion rules listed below.

  3. If the function is a built-in function, it is evaluated using the converted argument values. The result is either an instance of the function's declared return type or a dynamic error. Errors raised by built-in functions are defined in [XQuery 1.0 and XPath 2.0 Functions and Operators].

  4. If the function is a user-declared function that has a body, the converted argument values are bound to the formal parameters of the function, and the function body is evaluated. The value returned by the function body is then converted to the declared return type of the function by applying the function conversion rules.

    When a converted argument value is bound to a function parameter, the argument value retains its most specific dynamic type, even though this type may be derived from the type of the formal parameter. For example, a function with a parameter $p of type xs:decimal can be invoked with an argument of type xs:integer, which is derived from xs:decimal. During the processing of this function invocation, the dynamic type of $p inside the body of the function is considered to be xs:integer. Similarly, the value returned by a function retains its most specific type, which may be derived from the declared return type of the function. For example, a function that has a declared return type of xs:decimal may in fact return a value of dynamic type xs:integer.

    During evaluation of a function body, the static context and dynamic context for expression evaluation are defined by the module in which the function is declared, which is not necessarily the same as the module in which the function is called. For example, the variables in scope while evaluating a function body are defined by in-scope variables of the module that declares the function rather than the module in which the function is called. During evaluation of a function body, the focus (context item, context position, and context size) is undefined, except where it is defined by some expression inside the function body.

  5. If the function is a user-declared external function, its function implementation is invoked with the converted argument values. The result is either a value of the declared type or an implementation-defined error (see 2.2.5 Consistency Constraints).

The function conversion rules are used to convert an argument value or a return value to its expected type; that is, to the declared type of the function parameter or return. The expected type is expressed as a sequence type. The function conversion rules are applied to a given value as follows:

  • If the expected type is a sequence of an atomic type (possibly with an occurrence indicator *, +, or ?), the following conversions are applied:

    1. Atomization is applied to the given value, resulting in a sequence of atomic values.

    2. Each item in the atomic sequence that is of type xs:untypedAtomic is cast to the expected atomic type. For built-in functions where the expected type is specified as numeric, arguments of type xs:untypedAtomic are cast to xs:double.

    3. For each numeric item in the atomic sequence that can be promoted to the expected atomic type using numeric promotion as described in B.1 Type Promotion, the promotion is done.

    4. For each item of type xs:anyURI in the atomic sequence that can be promoted to the expected atomic type using URI promotion as described in B.1 Type Promotion, the promotion is done.

  • If, after the above conversions, the resulting value does not match the expected type according to the rules for SequenceType Matching, a type error is raised [err:XPTY0004]. If the function call takes place in a module other than the module in which the function is defined, this rule must be satisfied in both the module where the function is called and the module where the function is defined (the test is repeated because the two modules may have different in-scope schema definitions.) Note that the rules for SequenceType Matching permit a value of a derived type to be substituted for a value of its base type.

Since the arguments of a function call are separated by commas, any argument expression that contains a top-level comma operator must be enclosed in parentheses. Here are some illustrative examples of function calls:

  • my:three-argument-function(1, 2, 3) denotes a function call with three arguments.

  • my:two-argument-function((1, 2), 3) denotes a function call with two arguments, the first of which is a sequence of two values.

  • my:two-argument-function(1, ()) denotes a function call with two arguments, the second of which is an empty sequence.

  • my:one-argument-function((1, 2, 3)) denotes a function call with one argument that is a sequence of three values.

  • my:one-argument-function(( )) denotes a function call with one argument that is an empty sequence.

  • my:zero-argument-function( ) denotes a function call with zero arguments.

3.2 Path Expressions

[91]    PathExpr    ::=    ("/" RelativePathExpr?)
| ("//" RelativePathExpr)
| RelativePathExpr
[92]    RelativePathExpr    ::=    StepExpr (("/" | "//") StepExpr)*

[Definition: A path expression can be used to locate nodes within trees. A path expression consists of a series of one or more steps, separated by "/" or "//", and optionally beginning with "/" or "//".] An initial "/" or "//" is an abbreviation for one or more initial steps that are implicitly added to the beginning of the path expression, as described below.

A path expression consisting of a single step is evaluated as described in 3.2.1 Steps.

A "/" at the beginning of a path expression is an abbreviation for the initial step (fn:root(self::node()) treat as document-node())/ (however, if the "/" is the entire path expression, the trailing "/" is omitted from the expansion.) The effect of this initial step is to begin the path at the root node of the tree that contains the context node. If the context item is not a node, a type error is raised [err:XPTY0020]. At evaluation time, if the root node above the context node is not a document node, a dynamic error is raised [err:XPDY0050].

A "//" at the beginning of a path expression is an abbreviation for the initial steps (fn:root(self::node()) treat as document-node())/descendant-or-self::node()/ (however, "//" by itself is not a valid path expression [err:XPST0003].) The effect of these initial steps is to establish an initial node sequence that contains the root of the tree in which the context node is found, plus all nodes descended from this root. This node sequence is used as the input to subsequent steps in the path expression. If the context item is not a node, a type error is raised [err:XPTY0020]. At evaluation time, if the root node above the context node is not a document node, a dynamic error is raised [err:XPDY0050].

Note:

The descendants of a node do not include attribute nodes .

Each non-initial occurrence of "//" in a path expression is expanded as described in 3.2.4 Abbreviated Syntax, leaving a sequence of steps separated by "/". This sequence of steps is then evaluated from left to right. Each operation E1/E2 is evaluated as follows: Expression E1 is evaluated, and if the result is not a (possibly empty) sequence of nodes, a type error is raised [err:XPTY0019]. Each node resulting from the evaluation of E1 then serves in turn to provide an inner focus for an evaluation of E2, as described in 2.1.2 Dynamic Context. The sequences resulting from all the evaluations of E2 are combined as follows:

  1. If every evaluation of E2 returns a (possibly empty) sequence of nodes, these sequences are combined, and duplicate nodes are eliminated based on node identity. If ordering mode is ordered, the resulting node sequence is returned in document order; otherwise it is returned in implementation-dependent order.

  2. If every evaluation of E2 returns a (possibly empty) sequence of atomic values, these sequences are concatenated and returned. If ordering mode is ordered, the returned sequence preserves the orderings within and among the subsequences generated by the evaluations of E2; otherwise the order of the returned sequence is implementation-dependent.

  3. If the multiple evaluations of E2 return at least one node and at least one atomic value, a type error is raised [err:XPTY0018].

Note:

Since each step in a path provides context nodes for the following step, in effect, only the last step in a path is allowed to return a sequence of atomic values.

As an example of a path expression, child::div1/child::para selects the para element children of the div1 element children of the context node, or, in other words, the para element grandchildren of the context node that have div1 parents.

Note:

The "/" character can be used either as a complete path expression or as the beginning of a longer path expression such as "/*". Also, "*" is both the multiply operator and a wildcard in path expressions. This can cause parsing difficulties when "/" appears on the left hand side of "*". This is resolved using the leading-lone-slash constraint. For example, "/*" and "/ *" are valid path expressions containing wildcards, but "/*5" and "/ * 5" raise syntax errors. Parentheses must be used when "/" is used on the left hand side of an operator, as in "(/) * 5". Similarly, "4 + / * 5" raises a syntax error, but "4 + (/) * 5" is a valid expression. The expression "4 + /" is also valid, because / does not occur on the left hand side of the operator.

3.2.1 Steps

[93]    StepExpr    ::=    FilterExpr | AxisStep
[94]    AxisStep    ::=    (ReverseStep | ForwardStep) PredicateList
[95]    ForwardStep    ::=    (ForwardAxis NodeTest) | AbbrevForwardStep
[98]    ReverseStep    ::=    (ReverseAxis NodeTest) | AbbrevReverseStep
[105]    PredicateList    ::=    Predicate*

[Definition: A step is a part of a path expression that generates a sequence of items and then filters the sequence by zero or more predicates. The value of the step consists of those items that satisfy the predicates, working from left to right. A step may be either an axis step or a filter expression.] Filter expressions are described in 3.3.2 Filter Expressions.

[Definition: An axis step returns a sequence of nodes that are reachable from the context node via a specified axis. Such a step has two parts: an axis, which defines the "direction of movement" for the step, and a node test, which selects nodes based on their kind, name, and/or type annotation.] If the context item is a node, an axis step returns a sequence of zero or more nodes; otherwise, a type error is raised [err:XPTY0020]. If ordering mode is ordered, the resulting node sequence is returned in document order; otherwise it is returned in implementation-dependent order. An axis step may be either a forward step or a reverse step, followed by zero or more predicates.

In the abbreviated syntax for a step, the axis can be omitted and other shorthand notations can be used as described in 3.2.4 Abbreviated Syntax.

The unabbreviated syntax for an axis step consists of the axis name and node test separated by a double colon. The result of the step consists of the nodes reachable from the context node via the specified axis that have the node kind, name, and/or type annotation specified by the node test. For example, the step child::para selects the para element children of the context node: child is the name of the axis, and para is the name of the element nodes to be selected on this axis. The available axes are described in 3.2.1.1 Axes. The available node tests are described in 3.2.1.2 Node Tests. Examples of steps are provided in 3.2.3 Unabbreviated Syntax and 3.2.4 Abbreviated Syntax.

3.2.1.1 Axes
[96]    ForwardAxis    ::=    ("child" "::")
| ("descendant" "::")
| ("attribute" "::")
| ("self" "::")
| ("descendant-or-self" "::")
| ("following-sibling" "::")
| ("following" "::")
[99]    ReverseAxis    ::=    ("parent" "::")
| ("ancestor" "::")
| ("preceding-sibling" "::")
| ("preceding" "::")
| ("ancestor-or-self" "::")

XQuery supports the following axes (subject to limitations as described in 5.2.4 Full Axis Feature):

  • The child axis contains the children of the context node, which are the nodes returned by the dm:children accessor in [XQuery/XPath Data Model (XDM)].

    Note:

    Only document nodes and element nodes have children. If the context node is any other kind of node, or if the context node is an empty document or element node, then the child axis is an empty sequence. The children of a document node or element node may be element, processing instruction, comment, or text nodes. Attribute and document nodes can never appear as children.

  • the descendant axis is defined as the transitive closure of the child axis; it contains the descendants of the context node (the children, the children of the children, and so on)

  • the parent axis contains the sequence returned by the dm:parent accessor in [XQuery/XPath Data Model (XDM)], which returns the parent of the context node, or an empty sequence if the context node has no parent

    Note:

    An attribute node may have an element node as its parent, even though the attribute node is not a child of the element node.

  • the ancestor axis is defined as the transitive closure of the parent axis; it contains the ancestors of the context node (the parent, the parent of the parent, and so on)

    Note:

    The ancestor axis includes the root node of the tree in which the context node is found, unless the context node is the root node.

  • the following-sibling axis contains the context node's following siblings, those children of the context node's parent that occur after the context node in document order; if the context node is an attribute node, the following-sibling axis is empty

  • the preceding-sibling axis contains the context node's preceding siblings, those children of the context node's parent that occur before the context node in document order; if the context node is an attribute node, the preceding-sibling axis is empty

  • the following axis contains all nodes that are descendants of the root of the tree in which the context node is found, are not descendants of the context node, and occur after the context node in document order

  • the preceding axis contains all nodes that are descendants of the root of the tree in which the context node is found, are not ancestors of the context node, and occur before the context node in document order

  • the attribute axis contains the attributes of the context node, which are the nodes returned by the dm:attributes accessor in [XQuery/XPath Data Model (XDM)]; the axis will be empty unless the context node is an element

  • the self axis contains just the context node itself

  • the descendant-or-self axis contains the context node and the descendants of the context node

  • the ancestor-or-self axis contains the context node and the ancestors of the context node; thus, the ancestor-or-self axis will always include the root node

Axes can be categorized as forward axes and reverse axes. An axis that only ever contains the context node or nodes that are after the context node in document order is a forward axis. An axis that only ever contains the context node or nodes that are before the context node in document order is a reverse axis.

The parent, ancestor, ancestor-or-self, preceding, and preceding-sibling axes are reverse axes; all other axes are forward axes. The ancestor, descendant, following, preceding and self axes partition a document (ignoring attribute nodes): they do not overlap and together they contain all the nodes in the document.

[Definition: Every axis has a principal node kind. If an axis can contain elements, then the principal node kind is element; otherwise, it is the kind of nodes that the axis can contain.] Thus:

  • For the attribute axis, the principal node kind is attribute.

  • For all other axes, the principal node kind is element.

3.2.1.2 Node Tests

[Definition: A node test is a condition that must be true for each node selected by a step.] The condition may be based on the kind of the node (element, attribute, text, document, comment, or processing instruction), the name of the node, or (in the case of element, attribute, and document nodes), the type annotation of the node.

[101]    NodeTest    ::=    KindTest | NameTest
[102]    NameTest    ::=    QName | Wildcard
[103]    Wildcard    ::=    "*"
| (NCName ":" "*")
| ("*" ":" NCName)

[Definition: A node test that consists only of a QName or a Wildcard is called a name test.] A name test is true if and only if the kind of the node is the principal node kind for the step axis and the expanded QName of the node is equal (as defined by the eq operator) to the expanded QName specified by the name test. For example, child::para selects the para element children of the context node; if the context node has no para children, it selects an empty set of nodes. attribute::abc:href selects the attribute of the context node with the QName abc:href; if the context node has no such attribute, it selects an empty set of nodes.

A QName in a name test is resolved into an expanded QName using the statically known namespaces in the expression context. It is a static error [err:XPST0081] if the QName has a prefix that does not correspond to any statically known namespace. An unprefixed QName, when used as a name test on an axis whose principal node kind is element, has the namespace URI of the default element/type namespace in the expression context; otherwise, it has no namespace URI.

A name test is not satisfied by an element node whose name does not match the expanded QName of the name test, even if it is in a substitution group whose head is the named element.

A node test * is true for any node of the principal node kind of the step axis. For example, child::* will select all element children of the context node, and attribute::* will select all attributes of the context node.

A node test can have the form NCName:*. In this case, the prefix is expanded in the same way as with a QName, using the statically known namespaces in the static context. If the prefix is not found in the statically known namespaces, a static error is raised [err:XPST0081]. The node test is true for any node of the principal node kind of the step axis whose expanded QName has the namespace URI to which the prefix is bound, regardless of the local part of the name.

A node test can also have the form *:NCName. In this case, the node test is true for any node of the principal node kind of the step axis whose local name matches the given NCName, regardless of its namespace or lack of a namespace.

[Definition: An alternative form of a node test called a kind test can select nodes based on their kind, name, and type annotation.] The syntax and semantics of a kind test are described in 2.5.3 SequenceType Syntax and 2.5.4 SequenceType Matching. When a kind test is used in a node test, only those nodes on the designated axis that match the kind test are selected. Shown below are several examples of kind tests that might be used in path expressions:

  • node() matches any node.

  • text() matches any text node.

  • comment() matches any comment node.

  • namespace-node() matches any namespace node.

  • element() matches any element node.

  • schema-element(person) matches any element node whose name is person (or is in the substitution group headed by person), and whose type annotation is the same as (or is derived from) the declared type of the person element in the in-scope element declarations.

  • element(person) matches any element node whose name is person, regardless of its type annotation.

  • element(person, surgeon) matches any non-nilled element node whose name is person, and whose type annotation is surgeon or is derived from surgeon.

  • element(*, surgeon) matches any non-nilled element node whose type annotation is surgeon (or is derived from surgeon), regardless of its name.

  • attribute() matches any attribute node.

  • attribute(price) matches any attribute whose name is price, regardless of its type annotation.

  • attribute(*, xs:decimal) matches any attribute whose type annotation is xs:decimal (or is derived from xs:decimal), regardless of its name.

  • document-node() matches any document node.

  • document-node(element(book)) matches any document node whose content consists of a single element node that satisfies the kind test element(book), interleaved with zero or more comments and processing instructions.

3.2.2 Predicates

[106]    Predicate    ::=    "[" Expr "]"

[Definition: A predicate consists of an expression, called a predicate expression, enclosed in square brackets. A predicate serves to filter a sequence, retaining some items and discarding others.] In the case of multiple adjacent predicates, the predicates are applied from left to right, and the result of applying each predicate serves as the input sequence for the following predicate.

For each item in the input sequence, the predicate expression is evaluated using an inner focus, defined as follows: The context item is the item currently being tested against the predicate. The context size is the number of items in the input sequence. The context position is the position of the context item within the input sequence. For the purpose of evaluating the context position within a predicate, the input sequence is considered to be sorted as follows: into document order if the predicate is in a forward-axis step, into reverse document order if the predicate is in a reverse-axis step, or in its original order if the predicate is not in a step.

For each item in the input sequence, the result of the predicate expression is coerced to an xs:boolean value, called the predicate truth value, as described below. Those items for which the predicate truth value is true are retained, and those for which the predicate truth value is false are discarded.

The predicate truth value is derived by applying the following rules, in order:

  1. If the value of the predicate expression is a singleton atomic value of a numeric type or derived from a numeric type, the predicate truth value is true if the value of the predicate expression is equal (by the eq operator) to the context position, and is false otherwise. [Definition: A predicate whose predicate expression returns a numeric type is called a numeric predicate.]

    Note:

    In a region of a query where ordering mode is unordered, the result of a numeric predicate is nondeterministic, as explained in 3.9 Ordered and Unordered Expressions.

  2. Otherwise, the predicate truth value is the effective boolean value of the predicate expression.

Here are some examples of axis steps that contain predicates:

  • This example selects the second chapter element that is a child of the context node:

    child::chapter[2]
    
  • This example selects all the descendants of the context node that are elements named "toy" and whose color attribute has the value "red":

    descendant::toy[attribute::color = "red"]
    
  • This example selects all the employee children of the context node that have both a secretary child element and an assistant child element:

    child::employee[secretary][assistant]
    

Note:

When using predicates with a sequence of nodes selected using a reverse axis, it is important to remember that the the context positions for such a sequence are assigned in reverse document order. For example, preceding::foo[1] returns the first qualifying foo element in reverse document order, because the predicate is part of an axis step using a reverse axis. By contrast, (preceding::foo)[1] returns the first qualifying foo element in document order, because the parentheses cause (preceding::foo) to be parsed as a primary expression in which context positions are assigned in document order. Similarly, ancestor::*[1] returns the nearest ancestor element, because the ancestor axis is a reverse axis, whereas (ancestor::*)[1] returns the root element (first ancestor in document order).

The fact that a reverse-axis step assigns context positions in reverse document order for the purpose of evaluating predicates does not alter the fact that the final result of the step (when in ordered mode) is always in document order.

3.2.3 Unabbreviated Syntax

This section provides a number of examples of path expressions in which the axis is explicitly specified in each step. The syntax used in these examples is called the unabbreviated syntax. In many common cases, it is possible to write path expressions more concisely using an abbreviated syntax, as explained in 3.2.4 Abbreviated Syntax.

  • child::para selects the para element children of the context node

  • child::* selects all element children of the context node

  • child::text() selects all text node children of the context node

  • child::node() selects all the children of the context node. Note that no attribute nodes are returned, because attributes are not children.

  • attribute::name selects the name attribute of the context node

  • attribute::* selects all the attributes of the context node

  • parent::node() selects the parent of the context node. If the context node is an attribute node, this expression returns the element node (if any) to which the attribute node is attached.

  • descendant::para selects the para element descendants of the context node

  • ancestor::div selects all div ancestors of the context node

  • ancestor-or-self::div selects the div ancestors of the context node and, if the context node is a div element, the context node as well

  • descendant-or-self::para selects the para element descendants of the context node and, if the context node is a para element, the context node as well

  • self::para selects the context node if it is a para element, and otherwise returns an empty sequence

  • child::chapter/descendant::para selects the para element descendants of the chapter element children of the context node

  • child::*/child::para selects all para grandchildren of the context node

  • / selects the root of the tree that contains the context node, but raises a dynamic error if this root is not a document node

  • /descendant::para selects all the para elements in the same document as the context node

  • /descendant::list/child::member selects all the member elements that have a list parent and that are in the same document as the context node

  • child::para[fn:position() = 1] selects the first para child of the context node

  • child::para[fn:position() = fn:last()] selects the last para child of the context node

  • child::para[fn:position() = fn:last()-1] selects the last but one para child of the context node

  • child::para[fn:position() > 1] selects all the para children of the context node other than the first para child of the context node

  • following-sibling::chapter[fn:position() = 1]selects the next chapter sibling of the context node

  • preceding-sibling::chapter[fn:position() = 1]selects the previous chapter sibling of the context node

  • /descendant::figure[fn:position() = 42] selects the forty-second figure element in the document containing the context node

  • /child::book/child::chapter[fn:position() = 5]/child::section[fn:position() = 2] selects the second section of the fifth chapter of the book whose parent is the document node that contains the context node

  • child::para[attribute::type eq "warning"]selects all para children of the context node that have a type attribute with value warning

  • child::para[attribute::type eq 'warning'][fn:position() = 5]selects the fifth para child of the context node that has a type attribute with value warning

  • child::para[fn:position() = 5][attribute::type eq "warning"]selects the fifth para child of the context node if that child has a type attribute with value warning

  • child::chapter[child::title = 'Introduction']selects the chapter children of the context node that have one or more title children whose typed value is equal to the string Introduction

  • child::chapter[child::title] selects the chapter children of the context node that have one or more title children

  • child::*[self::chapter or self::appendix] selects the chapter and appendix children of the context node

  • child::*[self::chapter or self::appendix][fn:position() = fn:last()] selects the last chapter or appendix child of the context node

3.2.4 Abbreviated Syntax

[97]    AbbrevForwardStep    ::=    "@"? NodeTest
[100]    AbbrevReverseStep    ::=    ".."

The abbreviated syntax permits the following abbreviations:

  1. The attribute axis attribute:: can be abbreviated by @. For example, a path expression para[@type="warning"] is short for child::para[attribute::type="warning"] and so selects para children with a type attribute with value equal to warning.

  2. If the axis name is omitted from an axis step, the default axis is child unless the axis step contains an AttributeTest or SchemaAttributeTest; in that case, the default axis is attribute. For example, the path expression section/para is an abbreviation for child::section/child::para, and the path expression section/@id is an abbreviation for child::section/attribute::id. Similarly, section/attribute(id) is an abbreviation for child::section/attribute::attribute(id). Note that the latter expression contains both an axis specification and a node test.

  3. Each non-initial occurrence of // is effectively replaced by /descendant-or-self::node()/ during processing of a path expression. For example, div1//para is short for child::div1/descendant-or-self::node()/child::para and so will select all para descendants of div1 children.

    Note:

    The path expression //para[1] does not mean the same as the path expression /descendant::para[1]. The latter selects the first descendant para element; the former selects all descendant para elements that are the first para children of their respective parents.

  4. A step consisting of .. is short for parent::node(). For example, ../title is short for parent::node()/child::title and so will select the title children of the parent of the context node.

    Note:

    The expression ., known as a context item expression, is a primary expression, and is described in 3.1.4 Context Item Expression.

Here are some examples of path expressions that use the abbreviated syntax:

  • para selects the para element children of the context node

  • * selects all element children of the context node

  • text() selects all text node children of the context node

  • @name selects the name attribute of the context node

  • @* selects all the attributes of the context node

  • para[1] selects the first para child of the context node

  • para[fn:last()] selects the last para child of the context node

  • */para selects all para grandchildren of the context node

  • /book/chapter[5]/section[2] selects the second section of the fifth chapter of the book whose parent is the document node that contains the context node

  • chapter//para selects the para element descendants of the chapter element children of the context node

  • //para selects all the para descendants of the root document node and thus selects all para elements in the same document as the context node

  • //@version selects all the version attribute nodes that are in the same document as the context node

  • //list/member selects all the member elements in the same document as the context node that have a list parent

  • .//para selects the para element descendants of the context node

  • .. selects the parent of the context node

  • ../@lang selects the lang attribute of the parent of the context node

  • para[@type="warning"] selects all para children of the context node that have a type attribute with value warning

  • para[@type="warning"][5] selects the fifth para child of the context node that has a type attribute with value warning

  • para[5][@type="warning"] selects the fifth para child of the context node if that child has a type attribute with value warning

  • chapter[title="Introduction"] selects the chapter children of the context node that have one or more title children whose typed value is equal to the string Introduction

  • chapter[title] selects the chapter children of the context node that have one or more title children

  • employee[@secretary and @assistant] selects all the employee children of the context node that have both a secretary attribute and an assistant attribute

  • book/(chapter|appendix)/section selects every section element that has a parent that is either a chapter or an appendix element, that in turn is a child of a book element that is a child of the context node.

  • If E is any expression that returns a sequence of nodes, then the expression E/. returns the same nodes in document order, with duplicates eliminated based on node identity.

3.3 Sequence Expressions

XQuery 1.1 supports operators to construct, filter, and combine sequences of items. Sequences are never nested—for example, combining the values 1, (2, 3), and ( ) into a single sequence results in the sequence (1, 2, 3).

3.3.1 Constructing Sequences

[38]    Expr    ::=    ExprSingle ("," ExprSingle)*
[72]    RangeExpr    ::=    AdditiveExpr ( "to" AdditiveExpr )?

[Definition: One way to construct a sequence is by using the comma operator, which evaluates each of its operands and concatenates the resulting sequences, in order, into a single result sequence.] Empty parentheses can be used to denote an empty sequence.

A sequence may contain duplicate atomic values or nodes, but a sequence is never an item in another sequence. When a new sequence is created by concatenating two or more input sequences, the new sequence contains all the items of the input sequences and its length is the sum of the lengths of the input sequences.

Note:

In places where the grammar calls for ExprSingle, such as the arguments of a function call, any expression that contains a top-level comma operator must be enclosed in parentheses.

Here are some examples of expressions that construct sequences:

  • The result of this expression is a sequence of five integers:

    (10, 1, 2, 3, 4)
    
  • This expression combines four sequences of length one, two, zero, and two, respectively, into a single sequence of length five. The result of this expression is the sequence 10, 1, 2, 3, 4.

    (10, (1, 2), (), (3, 4))
    
  • The result of this expression is a sequence containing all salary children of the context node followed by all bonus children.

    (salary, bonus)
    
  • Assuming that $price is bound to the value 10.50, the result of this expression is the sequence 10.50, 10.50.

    ($price, $price)
    

A range expression can be used to construct a sequence of consecutive integers. Each of the operands of the to operator is converted as though it was an argument of a function with the expected parameter type xs:integer?. If either operand is an empty sequence, or if the integer derived from the first operand is greater than the integer derived from the second operand, the result of the range expression is an empty sequence. If the two operands convert to the same integer, the result of the range expression is that integer. Otherwise, the result is a sequence containing the two integer operands and every integer between the two operands, in increasing order.

  • This example uses a range expression as one operand in constructing a sequence. It evaluates to the sequence 10, 1, 2, 3, 4.

    (10, 1 to 4)
    
  • This example constructs a sequence of length one containing the single integer 10.

    10 to 10
    
  • The result of this example is a sequence of length zero.

    15 to 10
    
  • This example uses the fn:reverse function to construct a sequence of six integers in decreasing order. It evaluates to the sequence 15, 14, 13, 12, 11, 10.

    fn:reverse(10 to 15)
    

3.3.2 Filter Expressions

[104]    FilterExpr    ::=    PrimaryExpr PredicateList
[105]    PredicateList    ::=    Predicate*

[Definition: A filter expression consists simply of a primary expression followed by zero or more predicates. The result of the filter expression consists of the items returned by the primary expression, filtered by applying each predicate in turn, working from left to right.] If no predicates are specified, the result is simply the result of the primary expression. The ordering of the items returned by a filter expression is the same as their order in the result of the primary expression. Context positions are assigned to items based on their ordinal position in the result sequence. The first context position is 1.

Here are some examples of filter expressions:

  • Given a sequence of products in a variable, return only those products whose price is greater than 100.

    $products[price gt 100]
    
  • List all the integers from 1 to 100 that are divisible by 5. (See 3.3.1 Constructing Sequences for an explanation of the to operator.)

    (1 to 100)[. mod 5 eq 0]
    
  • The result of the following expression is the integer 25:

    (21 to 29)[5]
    
  • The following example returns the fifth through ninth items in the sequence bound to variable $orders.

    $orders[fn:position() = (5 to 9)]
    
  • The following example illustrates the use of a filter expression as a step in a path expression. It returns the last chapter or appendix within the book bound to variable $book:

    $book/(chapter | appendix)[fn:last()]
    
  • The following example also illustrates the use of a filter expression as a step in a path expression. It returns the element node within the specified document whose ID value is tiger:

    fn:doc("zoo.xml")/fn:id('tiger')
    

3.3.3 Combining Node Sequences

[75]    UnionExpr    ::=    IntersectExceptExpr ( ("union" | "|") IntersectExceptExpr )*
[76]    IntersectExceptExpr    ::=    InstanceofExpr ( ("intersect" | "except") InstanceofExpr )*

XQuery 1.1 provides the following operators for combining sequences of nodes:

  • The union and | operators are equivalent. They take two node sequences as operands and return a sequence containing all the nodes that occur in either of the operands.

  • The intersect operator takes two node sequences as operands and returns a sequence containing all the nodes that occur in both operands.

  • The except operator takes two node sequences as operands and returns a sequence containing all the nodes that occur in the first operand but not in the second operand.

All these operators eliminate duplicate nodes from their result sequences based on node identity. If ordering mode is ordered, the resulting sequence is returned in document order; otherwise it is returned in implementation-dependent order.

If an operand of union, intersect, or except contains an item that is not a node, a type error is raised [err:XPTY0004].

Here are some examples of expressions that combine sequences. Assume the existence of three element nodes that we will refer to by symbolic names A, B, and C. Assume that the variables $seq1, $seq2 and $seq3 are bound to the following sequences of these nodes:

  • $seq1 is bound to (A, B)

  • $seq2 is bound to (A, B)

  • $seq3 is bound to (B, C)

Then:

  • $seq1 union $seq2 evaluates to the sequence (A, B).

  • $seq2 union $seq3 evaluates to the sequence (A, B, C).

  • $seq1 intersect $seq2 evaluates to the sequence (A, B).

  • $seq2 intersect $seq3 evaluates to the sequence containing B only.

  • $seq1 except $seq2 evaluates to the empty sequence.

  • $seq2 except $seq3 evaluates to the sequence containing A only.

In addition to the sequence operators described here, [XQuery 1.0 and XPath 2.0 Functions and Operators] includes functions for indexed access to items or sub-sequences of a sequence, for indexed insertion or removal of items in a sequence, and for removing duplicate items from a sequence.

3.4 Arithmetic Expressions

XQuery 1.1 provides arithmetic operators for addition, subtraction, multiplication, division, and modulus, in their usual binary and unary forms.

[73]    AdditiveExpr    ::=    MultiplicativeExpr ( ("+" | "-") MultiplicativeExpr )*
[74]    MultiplicativeExpr    ::=    UnionExpr ( ("*" | "div" | "idiv" | "mod") UnionExpr )*
[81]    UnaryExpr    ::=    ("-" | "+")* ValueExpr
[82]    ValueExpr    ::=    ValidateExpr | PathExpr | ExtensionExpr

A subtraction operator must be preceded by whitespace if it could otherwise be interpreted as part of the previous token. For example, a-b will be interpreted as a name, but a - b and a -b will be interpreted as arithmetic expressions. (See A.2.4 Whitespace Rules for further details on whitespace handling.)

The first step in evaluating an arithmetic expression is to evaluate its operands. The order in which the operands are evaluated is implementation-dependent.

Each operand is evaluated by applying the following steps, in order:

  1. Atomization is applied to the operand. The result of this operation is called the atomized operand.

  2. If the atomized operand is an empty sequence, the result of the arithmetic expression is an empty sequence, and the implementation need not evaluate the other operand or apply the operator. However, an implementation may choose to evaluate the other operand in order to determine whether it raises an error.

  3. If the atomized operand is a sequence of length greater than one, a type error is raised [err:XPTY0004].

  4. If the atomized operand is of type xs:untypedAtomic, it is cast to xs:double. If the cast fails, a dynamic error is raised. [err:FORG0001]

After evaluation of the operands, if the types of the operands are a valid combination for the given arithmetic operator, the operator is applied to the operands, resulting in an atomic value or a dynamic error (for example, an error might result from dividing by zero.) The combinations of atomic types that are accepted by the various arithmetic operators, and their respective result types, are listed in B.2 Operator Mapping together with the operator functions that define the semantics of the operator for each type combination, including the dynamic errors that can be raised by the operator. The definitions of the operator functions are found in [XQuery 1.0 and XPath 2.0 Functions and Operators].

If the types of the operands, after evaluation, are not a valid combination for the given operator, according to the rules in B.2 Operator Mapping, a type error is raised [err:XPTY0004].

XQuery 1.1 supports two division operators named div and idiv. Each of these operators accepts two operands of any numeric type. As described in [XQuery 1.0 and XPath 2.0 Functions and Operators], $arg1 idiv $arg2 is equivalent to ($arg1 div $arg2) cast as xs:integer? except for error cases.

Here are some examples of arithmetic expressions:

  • The first expression below returns the xs:decimal value -1.5, and the second expression returns the xs:integer value -1:

    -3 div 2
    -3 idiv 2
    
  • Subtraction of two date values results in a value of type xs:dayTimeDuration:

    $emp/hiredate - $emp/birthdate
    
  • This example illustrates the difference between a subtraction operator and a hyphen:

    $unit-price - $unit-discount
    
  • Unary operators have higher precedence than binary operators, subject of course to the use of parentheses. Therefore, the following two examples have different meanings:

    -$bellcost + $whistlecost
    -($bellcost + $whistlecost)
    

Note:

Multiple consecutive unary arithmetic operators are permitted by XQuery 1.1 for compatibility with [XPath 1.0].

3.5 Comparison Expressions

Comparison expressions allow two values to be compared. XQuery 1.1 provides three kinds of comparison expressions, called value comparisons, general comparisons, and node comparisons.

[71]    ComparisonExpr    ::=    RangeExpr ( (ValueComp
| GeneralComp
| NodeComp) RangeExpr )?
[84]    ValueComp    ::=    "eq" | "ne" | "lt" | "le" | "gt" | "ge"
[83]    GeneralComp    ::=    "=" | "!=" | "<" | "<=" | ">" | ">="
[85]    NodeComp    ::=    "is" | "<<" | ">>"

3.5.1 Value Comparisons

The value comparison operators are eq, ne, lt, le, gt, and ge. Value comparisons are used for comparing single values.

The first step in evaluating a value comparison is to evaluate its operands. The order in which the operands are evaluated is implementation-dependent. Each operand is evaluated by applying the following steps, in order:

  1. Atomization is applied to the operand. The result of this operation is called the atomized operand.

  2. If the atomized operand is an empty sequence, the result of the value comparison is an empty sequence, and the implementation need not evaluate the other operand or apply the operator. However, an implementation may choose to evaluate the other operand in order to determine whether it raises an error.

  3. If the atomized operand is a sequence of length greater than one, a type error is raised [err:XPTY0004].

  4. If the atomized operand is of type xs:untypedAtomic, it is cast to xs:string.

    Note:

    The purpose of this rule is to make value comparisons transitive. Users should be aware that the general comparison operators have a different rule for casting of xs:untypedAtomic operands. Users should also be aware that transitivity of value comparisons may be compromised by loss of precision during type conversion (for example, two xs:integer values that differ slightly may both be considered equal to the same xs:float value because xs:float has less precision than xs:integer).

Next, if possible, the two operands are converted to their least common type by a combination of type promotion and subtype substitution. For example, if the operands are of type hatsize (derived from xs:integer) and shoesize (derived from xs:float), their least common type is xs:float.

Finally, if the types of the operands are a valid combination for the given operator, the operator is applied to the operands. The combinations of atomic types that are accepted by the various value comparison operators, and their respective result types, are listed in B.2 Operator Mapping together with the operator functions that define the semantics of the operator for each type combination. The definitions of the operator functions are found in [XQuery 1.0 and XPath 2.0 Functions and Operators].

Informally, if both atomized operands consist of exactly one atomic value, then the result of the comparison is true if the value of the first operand is (equal, not equal, less than, less than or equal, greater than, greater than or equal) to the value of the second operand; otherwise the result of the comparison is false.

If the types of the operands, after evaluation, are not a valid combination for the given operator, according to the rules in B.2 Operator Mapping, a type error is raised [err:XPTY0004].

Here are some examples of value comparisons:

  • The following comparison atomizes the node(s) that are returned by the expression $book/author. The comparison is true only if the result of atomization is the value "Kennedy" as an instance of xs:string or xs:untypedAtomic. If the result of atomization is an empty sequence, the result of the comparison is an empty sequence. If the result of atomization is a sequence containing more than one value, a type error is raised [err:XPTY0004].

    $book1/author eq "Kennedy"
    
  • The following path expression contains a predicate that selects products whose weight is greater than 100. For any product that does not have a weight subelement, the value of the predicate is the empty sequence, and the product is not selected. This example assumes that weight is a validated element with a numeric type.

    //product[weight gt 100]
    
  • The following comparisons are true because, in each case, the two constructed nodes have the same value after atomization, even though they have different identities and/or names:

    <a>5</a> eq <a>5</a>
    
    <a>5</a> eq <b>5</b>
    
  • The following comparison is true if my:hatsize and my:shoesize are both user-defined types that are derived by restriction from a primitive numeric type:

    my:hatsize(5) eq my:shoesize(5)
    
  • The following comparison is true. The eq operator compares two QNames by performing codepoint-comparisons of their namespace URIs and their local names, ignoring their namespace prefixes.

    fn:QName("http://example.com/ns1", "this:color")
       eq fn:QName("http://example.com/ns1", "that:color")
    

3.5.2 General Comparisons

The general comparison operators are =, !=, <, <=, >, and >=. General comparisons are existentially quantified comparisons that may be applied to operand sequences of any length. The result of a general comparison that does not raise an error is always true or false.

A general comparison is evaluated by applying the following rules, in order:

  1. Atomization is applied to each operand. After atomization, each operand is a sequence of atomic values.

  2. The result of the comparison is true if and only if there is a pair of atomic values, one in the first operand sequence and the other in the second operand sequence, that have the required magnitude relationship. Otherwise the result of the comparison is false. The magnitude relationship between two atomic values is determined by applying the following rules. If a cast operation called for by these rules is not successful, a dynamic error is raised. [err:FORG0001]

    Note:

    The purpose of these rules is to preserve compatibility with XPath 1.0, in which (for example) x < 17 is a numeric comparison if x is an untyped value. Users should be aware that the value comparison operators have different rules for casting of xs:untypedAtomic operands.

    1. If one of the atomic values is an instance of xs:untypedAtomic and the other is an instance of a numeric type, then the xs:untypedAtomic value is cast to the type xs:double.

    2. If one of the atomic values is an instance of xs:untypedAtomic and the other is an instance of xs:untypedAtomic or xs:string, then the xs:untypedAtomic value (or values) is (are) cast to the type xs:string.

    3. If one of the atomic values is an instance of xs:untypedAtomic and the other is not an instance of xs:string, xs:untypedAtomic, or any numeric type, then the xs:untypedAtomic value is cast to the dynamic type of the other value.

    4. After performing the conversions described above, the atomic values are compared using one of the value comparison operators eq, ne, lt, le, gt, or ge, depending on whether the general comparison operator was =, !=, <, <=, >, or >=. The values have the required magnitude relationship if and only if the result of this value comparison is true.

When evaluating a general comparison in which either operand is a sequence of items, an implementation may return true as soon as it finds an item in the first operand and an item in the second operand that have the required magnitude relationship. Similarly, a general comparison may raise a dynamic error as soon as it encounters an error in evaluating either operand, or in comparing a pair of items from the two operands. As a result of these rules, the result of a general comparison is not deterministic in the presence of errors.

Here are some examples of general comparisons:

  • The following comparison is true if the typed value of any author subelement of $book1 is "Kennedy" as an instance of xs:string or xs:untypedAtomic:

    $book1/author = "Kennedy"
    
  • The following example contains three general comparisons. The value of the first two comparisons is true, and the value of the third comparison is false. This example illustrates the fact that general comparisons are not transitive.

    (1, 2) = (2, 3)
    (2, 3) = (3, 4)
    (1, 2) = (3, 4)
    
  • The following example contains two general comparisons, both of which are true. This example illustrates the fact that the = and != operators are not inverses of each other.

    (1, 2) = (2, 3)
    (1, 2) != (2, 3)
    
  • Suppose that $a, $b, and $c are bound to element nodes with type annotation xs:untypedAtomic, with string values "1", "2", and "2.0" respectively. Then ($a, $b) = ($c, 3.0) returns false, because $b and $c are compared as strings. However, ($a, $b) = ($c, 2.0) returns true, because $b and 2.0 are compared as numbers.

3.5.3 Node Comparisons

Node comparisons are used to compare two nodes, by their identity or by their document order. The result of a node comparison is defined by the following rules:

  1. The operands of a node comparison are evaluated in implementation-dependent order.

  2. If either operand is an empty sequence, the result of the comparison is an empty sequence, and the implementation need not evaluate the other operand or apply the operator. However, an implementation may choose to evaluate the other operand in order to determine whether it raises an error.

  3. Each operand must be either a single node or an empty sequence; otherwise a type error is raised [err:XPTY0004].

  4. A comparison with the is operator is true if the two operand nodes have the same identity, and are thus the same node; otherwise it is false. See [XQuery/XPath Data Model (XDM)] for a definition of node identity.

  5. A comparison with the << operator returns true if the left operand node precedes the right operand node in document order; otherwise it returns false.

  6. A comparison with the >> operator returns true if the left operand node follows the right operand node in document order; otherwise it returns false.

Here are some examples of node comparisons:

  • The following comparison is true only if the left and right sides each evaluate to exactly the same single node:

    /books/book[isbn="1558604820"] is /books/book[call="QA76.9 C3845"]
    
  • The following comparison is false because each constructed node has its own identity:

    <a>5</a> is <a>5</a>
    
  • The following comparison is true only if the node identified by the left side occurs before the node identified by the right side in document order:

    /transactions/purchase[parcel="28-451"] 
       << /transactions/sale[parcel="33-870"]
    

3.6 Logical Expressions

A logical expression is either an and-expression or an or-expression. If a logical expression does not raise an error, its value is always one of the boolean values true or false.

[69]    OrExpr    ::=    AndExpr ( "or" AndExpr )*
[70]    AndExpr    ::=    ComparisonExpr ( "and" ComparisonExpr )*

The first step in evaluating a logical expression is to find the effective boolean value of each of its operands (see 2.4.3 Effective Boolean Value).

The value of an and-expression is determined by the effective boolean values (EBV's) of its operands, as shown in the following table:

AND: EBV2 = true EBV2 = false error in EBV2
EBV1 = true true false error
EBV1 = false false false either false or error
error in EBV1 error either false or error error

The value of an or-expression is determined by the effective boolean values (EBV's) of its operands, as shown in the following table:

OR: EBV2 = true EBV2 = false error in EBV2
EBV1 = true true true either true or error
EBV1 = false true false error
error in EBV1 either true or error error error

The order in which the operands of a logical expression are evaluated is implementation-dependent. The tables above are defined in such a way that an or-expression can return true if the first expression evaluated is true, and it can raise an error if evaluation of the first expression raises an error. Similarly, an and-expression can return false if the first expression evaluated is false, and it can raise an error if evaluation of the first expression raises an error. As a result of these rules, a logical expression is not deterministic in the presence of errors, as illustrated in the examples below.

Here are some examples of logical expressions:

  • The following expressions return true:

    1 eq 1 and 2 eq 2
    
    1 eq 1 or 2 eq 3
    
  • The following expression may return either false or raise a dynamic error:

    1 eq 2 and 3 idiv 0 = 1
    
  • The following expression may return either true or raise a dynamic error:

    1 eq 1 or 3 idiv 0 = 1
    
  • The following expression must raise a dynamic error:

    1 eq 1 and 3 idiv 0 = 1
    

In addition to and- and or-expressions, XQuery 1.1 provides a function named fn:not that takes a general sequence as parameter and returns a boolean value. The fn:not function is defined in [XQuery 1.0 and XPath 2.0 Functions and Operators]. The fn:not function reduces its parameter to an effective boolean value. It then returns true if the effective boolean value of its parameter is false, and false if the effective boolean value of its parameter is true. If an error is encountered in finding the effective boolean value of its operand, fn:not raises the same error.

3.7 Constructors

XQuery provides constructors that can create XML structures within a query. Constructors are provided for element, attribute, document, text, comment, and processing instruction nodes. Two kinds of constructors are provided: direct constructors, which use an XML-like notation, and computed constructors, which use a notation based on enclosed expressions.

[117]    Constructor    ::=    DirectConstructor
| ComputedConstructor
[118]    DirectConstructor    ::=    DirElemConstructor
| DirCommentConstructor
| DirPIConstructor
[119]    DirElemConstructor    ::=    "<" QName DirAttributeList ("/>" | (">" DirElemContent* "</" QName S? ">"))
[124]    DirElemContent    ::=    DirectConstructor
| CDataSection
| CommonContent
| ElementContentChar
[185]    ElementContentChar    ::=    Char - [{}<&]
[125]    CommonContent    ::=    PredefinedEntityRef | CharRef | "{{" | "}}" | EnclosedExpr
[130]    CDataSection    ::=    "<![CDATA[" CDataSectionContents "]]>"
[131]    CDataSectionContents    ::=    (Char* - (Char* ']]>' Char*))
[120]    DirAttributeList    ::=    (S (QName S? "=" S? DirAttributeValue)?)*
[121]    DirAttributeValue    ::=    ('"' (EscapeQuot | QuotAttrValueContent)* '"')
| ("'" (EscapeApos | AposAttrValueContent)* "'")
[122]    QuotAttrValueContent    ::=    QuotAttrContentChar
| CommonContent
[123]    AposAttrValueContent    ::=    AposAttrContentChar
| CommonContent
[186]    QuotAttrContentChar    ::=    Char - ["{}<&]
[187]    AposAttrContentChar    ::=    Char - ['{}<&]
[183]    EscapeQuot    ::=    '""'
[184]    EscapeApos    ::=    "''"
[36]    EnclosedExpr    ::=    "{" Expr "}"

This section contains a conceptual description of the semantics of various kinds of constructor expressions. An XQuery implementation is free to use any implementation technique that produces the same result as the processing steps described in this section.

3.7.1 Direct Element Constructors

An element constructor creates an element node. [Definition: A direct element constructor is a form of element constructor in which the name of the constructed element is a constant.] Direct element constructors are based on standard XML notation. For example, the following expression is a direct element constructor that creates a book element containing an attribute and some nested elements:

<book isbn="isbn-0060229357">
    <title>Harold and the Purple Crayon</title>
    <author>
        <first>Crockett</first>
        <last>Johnson</last>
    </author>
</book>

If the element name in a direct element constructor has a namespace prefix, the namespace prefix is resolved to a namespace URI using the statically known namespaces. If the element name has no namespace prefix, it is implicitly qualified by the default element/type namespace. Note that both the statically known namespaces and the default element/type namespace may be affected by namespace declaration attributes found inside the element constructor. The namespace prefix of the element name is retained after expansion of the QName, as described in [XQuery/XPath Data Model (XDM)]. The resulting expanded QName becomes the node-name property of the constructed element node.

In a direct element constructor, the name used in the end tag must exactly match the name used in the corresponding start tag, including its prefix or absence of a prefix.

In a direct element constructor, curly braces { } delimit enclosed expressions, distinguishing them from literal text. Enclosed expressions are evaluated and replaced by their value, as illustrated by the following example:

<example>
   <p> Here is a query. </p>
   <eg> $b/title </eg>
   <p> Here is the result of the query. </p>
   <eg>{ $b/title }</eg>
</example>

The above query might generate the following result (whitespace has been added for readability to this result and other result examples in this document):

<example>
  <p> Here is a query. </p>
  <eg> $b/title </eg>
  <p> Here is the result of the query. </p>
  <eg><title>Harold and the Purple Crayon</title></eg>
</example>

Since XQuery uses curly braces to denote enclosed expressions, some convention is needed to denote a curly brace used as an ordinary character. For this purpose, a pair of identical curly brace characters within the content of an element or attribute are interpreted by XQuery as a single curly brace character (that is, the pair "{{" represents the character "{" and the pair "}}" represents the character "}".) Alternatively, the character references &#x7b; and &#x7d; can be used to denote curly brace characters. A single left curly brace ("{") is interpreted as the beginning delimiter for an enclosed expression. A single right curly brace ("}") without a matching left curly brace is treated as a static error [err:XPST0003].

The result of an element constructor is a new element node, with its own node identity. All the attribute and descendant nodes of the new element node are also new nodes with their own identities, even if they are copies of existing nodes.

3.7.1.1 Attributes

The start tag of a direct element constructor may contain one or more attributes. As in XML, each attribute is specified by a name and a value. In a direct element constructor, the name of each attribute is specified by a constant QName, and the value of the attribute is specified by a string of characters enclosed in single or double quotes. As in the main content of the element constructor, an attribute value may contain expressions enclosed in curly braces, which are evaluated and replaced by their value during processing of the element constructor.

Each attribute in a direct element constructor creates a new attribute node, with its own node identity, whose parent is the constructed element node. However, note that namespace declaration attributes (see 3.7.1.2 Namespace Declaration Attributes) do not create attribute nodes.

If an attribute name has a namespace prefix, the prefix is resolved to a namespace URI using the statically known namespaces. If the attribute name has no namespace prefix, the attribute is in no namespace. Note that the statically known namespaces used in resolving an attribute name may be affected by namespace declaration attributes that are found inside the same element constructor. The namespace prefix of the attribute name is retained after expansion of the QName, as described in [XQuery/XPath Data Model (XDM)]. The resulting expanded QName becomes the node-name property of the constructed attribute node.

If the attributes in a direct element constructor do not have distinct expanded QNames as their respective node-name properties, a static error is raised [err:XQST0040].

Conceptually, an attribute (other than a namespace declaration attribute) in a direct element constructor is processed by the following steps:

  1. Each consecutive sequence of literal characters in the attribute content is treated as a string containing those characters. Attribute value normalization is then applied to normalize whitespace and expand character references and predefined entity references. An XQuery processor that supports XML 1.0 uses the rules for attribute value normalization in Section 3.3.3 of [XML 1.0]; an XQuery processor that supports XML 1.1 uses the rules for attribute value normalization in Section 3.3.3 of [XML 1.1]. In either case, the normalization rules are applied as though the type of the attribute were CDATA (leading and trailing whitespace characters are not stripped.) The choice between XML 1.0 and XML 1.1 rules is implementation-defined.

  2. Each enclosed expression is converted to a string as follows:

    1. Atomization is applied to the value of the enclosed expression, converting it to a sequence of atomic values.

    2. If the result of atomization is an empty sequence, the result is the zero-length string. Otherwise, each atomic value in the atomized sequence is cast into a string.

    3. The individual strings resulting from the previous step are merged into a single string by concatenating them with a single space character between each pair.

  3. Adjacent strings resulting from the above steps are concatenated with no intervening blanks. The resulting string becomes the string-value property of the attribute node. The attribute node is given a type annotation (type-name property) of xs:untypedAtomic (this type annotation may change if the parent element is validated). The typed-value property of the attribute node is the same as its string-value, as an instance of xs:untypedAtomic.

  4. The parent property of the attribute node is set to the element node constructed by the direct element constructor that contains this attribute.

  5. If the attribute name is xml:id, then xml:id processing is performed as defined in [XML ID]. This ensures that the attribute has the type xs:ID and that its value is properly normalized. If an error is encountered during xml:id processing, an implementation MAY raise a dynamic error [err:XQDY0091].

  6. If the attribute name is xml:id, the is-id property of the resulting attribute node is set to true; otherwise the is-id property is set to false. The is-idrefs property of the attribute node is unconditionally set to false.

  • Example:

    <shoe size="7"/>
    

    The string value of the size attribute is "7".

  • Example:

    <shoe size="{7}"/>
    

    The string value of the size attribute is "7".

  • Example:

    <shoe size="{()}"/>
    

    The string value of the size attribute is the zero-length string.

  • Example:

    <chapter ref="[{1, 5 to 7, 9}]"/>
    

    The string value of the ref attribute is "[1 5 6 7 9]".

  • Example:

    <shoe size="As big as {$hat/@size}"/>
    

    The string value of the size attribute is the string "As big as ", concatenated with the string value of the node denoted by the expression $hat/@size.

3.7.1.2 Namespace Declaration Attributes

The names of a constructed element and its attributes may be QNames that include namespace prefixes. Namespace prefixes can be bound to namespaces in the Prolog or by namespace declaration attributes. It is a static error to use a namespace prefix that has not been bound to a namespace [err:XPST0081].

[Definition: A namespace declaration attribute is used inside a direct element constructor. Its purpose is to bind a namespace prefix or to set the default element/type namespace for the constructed element node, including its attributes.] Syntactically, a namespace declaration attribute has the form of an attribute with namespace prefix xmlns, or with name xmlns and no namespace prefix. The value of a namespace declaration attribute must be a URILiteral; otherwise a static error is raised [err:XQST0022]. All the namespace declaration attributes of a given element must have distinct names [err:XQST0071]. Each namespace declaration attribute is processed as follows:

  • The local part of the attribute name is interpreted as a namespace prefix and the value of the attribute is interpreted as a namespace URI. This prefix and URI are added to the statically known namespaces of the constructor expression (overriding any existing binding of the given prefix), and are also added as a namespace binding to the in-scope namespaces of the constructed element. If the namespace URI is a zero-length string and the implementation supports [XML Names 1.1], any existing namespace binding for the given prefix is removed from the in-scope namespaces of the constructed element and from the statically known namespaces of the constructor expression. If the namespace URI is a zero-length string and the implementation does not support [XML Names 1.1], a static error is raised [err:XQST0085]. It is implementation-defined whether an implementation supports [XML Names] or [XML Names 1.1].

  • If the name of the namespace declaration attribute is xmlns with no prefix, the value of the attribute is interpreted as a namespace URI. This URI specifies the default element/type namespace of the constructor expression (overriding any existing default), and is added (with no prefix) to the in-scope namespaces of the constructed element (overriding any existing namespace binding with no prefix). If the namespace URI is a zero-length string, the default element/type namespace of the constructor expression is set to "none," and any no-prefix namespace binding is removed from the in-scope namespaces of the constructed element.

  • It is a static error [err:XQST0070] if a namespace declaration attribute binds a namespace URI to the predefined prefix xmlns. It is also a static error [err:XQST0070] if a namespace declaration attribute binds a namespace URI other than http://www.w3.org/XML/1998/namespace to the prefix xml, or binds a prefix other than xml to the namespace URI http://www.w3.org/XML/1998/namespace.

A namespace declaration attribute does not cause an attribute node to be created.

The following examples illustrate namespace declaration attributes:

  • In this element constructor, a namespace declaration attribute is used to set the default element/type namespace to http://example.org/animals:

    <cat xmlns = "http://example.org/animals">
      <breed>Persian</breed>
    </cat>
    
  • In this element constructor, namespace declaration attributes are used to bind the namespace prefixes metric and english:

    <box xmlns:metric = "http://example.org/metric/units"
         xmlns:english = "http://example.org/english/units">
      <height> <metric:meters>3</metric:meters> </height>
      <width> <english:feet>6</english:feet> </width>
      <depth> <english:inches>18</english:inches> </depth>
    </box>
    
3.7.1.3 Content

The part of a direct element constructor between the start tag and the end tag is called the content of the element constructor. This content may consist of text characters (parsed as ElementContentChar), nested direct constructors, CdataSections, character and predefined entity references, and expressions enclosed in curly braces. In general, the value of an enclosed expression may be any sequence of nodes and/or atomic values. Enclosed expressions can be used in the content of an element constructor to compute both the content and the attributes of the constructed node.

Conceptually, the content of an element constructor is processed as follows:

  1. The content is evaluated to produce a sequence of nodes called the content sequence, as follows:

    1. If the boundary-space policy in the static context is strip, boundary whitespace is identified and deleted (see 3.7.1.4 Boundary Whitespace for a definition of boundary whitespace.)

    2. Predefined entity references and character references are expanded into their referenced strings, as described in 3.1.1 Literals. Characters inside a CDataSection, including special characters such as < and &, are treated as literal characters rather than as markup characters (except for the sequence ]]>, which terminates the CDataSection).

    3. Each consecutive sequence of literal characters evaluates to a single text node containing the characters.

    4. Each nested direct constructor is evaluated according to the rules in 3.7.1 Direct Element Constructors or 3.7.2 Other Direct Constructors, resulting in a new element, comment, or processing instruction node. Then:

      1. The parent property of the resulting node is then set to the newly constructed element node.

      2. The base-uri property of the resulting node, and of each of its descendants, is set to be the same as that of its new parent, unless it (the child node) has an xml:base attribute, in which case its base-uri property is set to the value of that attribute, resolved (if it is relative) against the base-uri property of its new parent node.

    5. Enclosed expressions are evaluated as follows:

      1. For each adjacent sequence of one or more atomic values returned by an enclosed expression, a new text node is constructed, containing the result of casting each atomic value to a string, with a single space character inserted between adjacent values.

        Note:

        The insertion of blank characters between adjacent values applies even if one or both of the values is a zero-length string.

      2. For each node returned by an enclosed expression, a new copy is made of the given node and all nodes that have the given node as an ancestor, collectively referred to as copied nodes. The properties of the copied nodes are as follows:

        1. Each copied node receives a new node identity.

        2. The parent, children, and attributes properties of the copied nodes are set so as to preserve their inter-node relationships. For the topmost node (the node directly returned by the enclosed expression), the parent property is set to the node constructed by this constructor.

        3. If construction mode in the static context is strip:

          1. If the copied node is an element node, its type-name property is set to xs:untyped. Its nilled, is-id, and is-idrefs properties are set to false.

          2. If the copied node is an attribute node, its type-name property is set to xs:untypedAtomic. Its is-idrefs property is set to false. Its is-id property is set to true if the qualified name of the attribute node is xml:id; otherwise it is set to false.

          3. The string-value of each copied element and attribute node remains unchanged, and its typed-value becomes equal to its string-value as an instance of xs:untypedAtomic.

            Note:

            Implementations that store only the typed value of a node are required at this point to convert the typed value to a string form.

          On the other hand, if construction mode in the static context is preserve, the type-name, nilled, string-value, typed-value, is-id, and is-idrefs properties of the copied nodes are preserved.

        4. The in-scope-namespaces property of a copied element node is determined by the following rules. In applying these rules, the default namespace or absence of a default namespace is treated like any other namespace binding:

          1. If copy-namespaces mode specifies preserve, all in-scope-namespaces of the original element are retained in the new copy. If copy-namespaces mode specifies no-preserve, the new copy retains only those in-scope namespaces of the original element that are used in the names of the element and its attributes.

          2. If copy-namespaces mode specifies inherit, the copied node inherits all the in-scope namespaces of the constructed node, augmented and overridden by the in-scope namespaces of the original element that were preserved by the preceding rule. If copy-namespaces mode specifies no-inherit, the copied node does not inherit any in-scope namespaces from the constructed node.

        5. An enclosed expression in the content of an element constructor may cause one or more existing nodes to be copied. Type error [err:XQTY0086] is raised in the following cases:

          1. An element node is copied, and the typed value of the element node or one of its attributes is namespace-sensitive, and construction mode is preserve, and copy-namespaces mode is no-preserve.

          2. An attribute node is copied but its parent element node is not copied, and the typed value of the copied attribute node is namespace-sensitive, and construction mode is preserve.

          [Definition: A value is namespace-sensitive if it includes an item whose dynamic type is xs:QName or xs:NOTATION or is derived by restriction from xs:QName or xs:NOTATION.]

          Note:

          The rationale for error [err:XQTY0086] is as follows: It is not possible to preserve the type of a QName without also preserving the namespace binding that defines the prefix of the QName.

        6. When an element or processing instruction node is copied, its base-uri property is set to be the same as that of its new parent, with the following exception: if a copied element node has an xml:base attribute, its base-uri property is set to the value of that attribute, resolved (if it is relative) against the base-uri property of the new parent node.

        7. All other properties of the copied nodes are preserved.

  2. If the content sequence contains a document node, the document node is replaced in the content sequence by its children.

  3. Adjacent text nodes in the content sequence are merged into a single text node by concatenating their contents, with no intervening blanks. After concatenation, any text node whose content is a zero-length string is deleted from the content sequence.

  4. If the content sequence contains an attribute node or a namespace node following a node that is not an attribute node or a namespace node, a type error is raised [err:XQTY0024].

  5. The properties of the newly constructed element node are determined as follows:

    1. node-name is the expanded QName resulting from resolving the element name in the start tag, including its original namespace prefix (if any), as described in 3.7.1 Direct Element Constructors.

    2. parent is set to empty.

    3. attributes consist of all the attributes specified in the start tag as described in 3.7.1.1 Attributes, together with all the attribute nodes in the content sequence, in implementation-dependent order. Note that the parent property of each of these attribute nodes has been set to the newly constructed element node. If two or more attributes have the same node-name, a dynamic error is raised [err:XQDY0025]. If an attribute named xml:space has a value other than preserve or default, a dynamic error MAY be raised [err:XQDY0092].

    4. children consist of all the element, text, comment, and processing instruction nodes in the content sequence. Note that the parent property of each of these nodes has been set to the newly constructed element node.

    5. base-uri is set to the following value:

      1. If the constructed node has an attribute named xml:base, then the value of this attribute, resolved if it is relative against the base URI in the static context. The value of the xml:base attribute is normalized as described in [XML Base].

      2. Otherwise, the value of the base URI in the static context.

    6. in-scope-namespaces consist of all the namespace bindings resulting from namespace declaration attributes as described in 3.7.1.2 Namespace Declaration Attributes, and possibly additional namespace bindings as described in 3.7.4 In-scope Namespaces of a Constructed Element.

    7. The nilled property is false.

    8. The string-value property is equal to the concatenated contents of the text-node descendants in document order. If there are no text-node descendants, the string-value property is a zero-length string.

    9. The typed-value property is equal to the string-value property, as an instance of xs:untypedAtomic.

    10. If construction mode in the static context is strip, the type-name property is xs:untyped. On the other hand, if construction mode is preserve, the type-name property is xs:anyType.

    11. The is-id and is-idrefs properties are set to false.

  • Example:

    <a>{1}</a>
    

    The constructed element node has one child, a text node containing the value "1".

  • Example:

    <a>{1, 2, 3}</a>
    

    The constructed element node has one child, a text node containing the value "1 2 3".

  • Example:

    <c>{1}{2}{3}</c>
    

    The constructed element node has one child, a text node containing the value "123".

  • Example:

    <b>{1, "2", "3"}</b>
    

    The constructed element node has one child, a text node containing the value "1 2 3".

  • Example:

    <fact>I saw 8 cats.</fact>
    

    The constructed element node has one child, a text node containing the value "I saw 8 cats.".

  • Example:

    <fact>I saw {5 + 3} cats.</fact>
    

    The constructed element node has one child, a text node containing the value "I saw 8 cats.".

  • Example:

    <fact>I saw <howmany>{5 + 3}</howmany> cats.</fact>
    

    The constructed element node has three children: a text node containing "I saw ", a child element node named howmany, and a text node containing " cats.". The child element node in turn has a single text node child containing the value "8".

3.7.1.4 Boundary Whitespace

In a direct element constructor, whitespace characters may appear in the content of the constructed element. In some cases, enclosed expressions and/or nested elements may be separated only by whitespace characters. For example, in the expression below, the end-tag </title> and the start-tag <author> are separated by a newline character and four space characters:

<book isbn="isbn-0060229357">
    <title>Harold and the Purple Crayon</title>
    <author>
        <first>Crockett</first>
        <last>Johnson</last>
    </author>
</book>

[Definition: Boundary whitespace is a sequence of consecutive whitespace characters within the content of a direct element constructor, that is delimited at each end either by the start or end of the content, or by a DirectConstructor, or by an EnclosedExpr. For this purpose, characters generated by character references such as &#x20; or by CdataSections are not considered to be whitespace characters.]

The boundary-space policy in the static context controls whether boundary whitespace is preserved by element constructors. If boundary-space policy is strip, boundary whitespace is not considered significant and is discarded. On the other hand, if boundary-space policy is preserve, boundary whitespace is considered significant and is preserved.

  • Example:

    <cat> 
       <breed>{$b}</breed>
       <color>{$c}</color> 
    </cat>
    

    The constructed cat element node has two child element nodes named breed and color. Whitespace surrounding the child elements will be stripped away by the element constructor if boundary-space policy is strip.

  • Example:

    <a>  {"abc"}  </a>
    

    If boundary-space policy is strip, this example is equivalent to <a>abc</a>. However, if boundary-space policy is preserve, this example is equivalent to <a>  abc  </a>.

  • Example:

    <a> z {"abc"}</a>
    

    Since the whitespace surrounding the z is not boundary whitespace, it is always preserved. This example is equivalent to <a> z abc</a>.

  • Example:

    <a>&#x20;{"abc"}</a>
    

    This example is equivalent to <a> abc</a>, regardless of the boundary-space policy, because the space generated by the character reference is not treated as a whitespace character.

  • Example:

    <a>{"  "}</a>
    

    This example constructs an element containing two space characters, regardless of the boundary-space policy, because whitespace inside an enclosed expression is never considered to be boundary whitespace.

Note:

Element constructors treat attributes named xml:space as ordinary attributes. An xml:space attribute does not affect the handling of whitespace by an element constructor.

3.7.2 Other Direct Constructors

XQuery allows an expression to generate a processing instruction node or a comment node. This can be accomplished by using a direct processing instruction constructor or a direct comment constructor. In each case, the syntax of the constructor expression is based on the syntax of a similar construct in XML.

[128]    DirPIConstructor    ::=    "<?" PITarget (S DirPIContents)? "?>"
[129]    DirPIContents    ::=    (Char* - (Char* '?>' Char*))
[126]    DirCommentConstructor    ::=    "<!--" DirCommentContents "-->"
[127]    DirCommentContents    ::=    ((Char - '-') | ('-' (Char - '-')))*

A direct processing instruction constructor creates a processing instruction node whose target property is PITarget and whose content property is DirPIContents. The base-uri property of the node is empty. The parent property of the node is empty.

The PITarget of a processing instruction must not consist of the characters "XML" in any combination of upper and lower case. The DirPIContents of a processing instruction must not contain the string "?>".

The following example illustrates a direct processing instruction constructor:

<?format role="output" ?>

A direct comment constructor creates a comment node whose content property is DirCommentContents. Its parent property is empty.

The DirCommentContents of a comment must not contain two consecutive hyphens or end with a hyphen. These rules are syntactically enforced by the grammar shown above.

The following example illustrates a direct comment constructor:

<!-- Tags are ignored in the following section -->

Note:

A direct comment constructor is different from a comment, since a direct comment constructor actually constructs a comment node, whereas a comment is simply used in documenting a query and is not evaluated.

3.7.3 Computed Constructors

[132]    ComputedConstructor    ::=    CompDocConstructor
| CompElemConstructor
| CompAttrConstructor
| CompNamespaceConstructor
| CompTextConstructor
| CompCommentConstructor
| CompPIConstructor

An alternative way to create nodes is by using a computed constructor. A computed constructor begins with a keyword that identifies the type of node to be created: element, attribute, document, text, processing-instruction, comment, or namespace.

For those kinds of nodes that have names (element, attribute, and processing instruction nodes), the keyword that specifies the node kind is followed by the name of the node to be created. This name may be specified either as a QName or as an expression enclosed in braces. [Definition: When an expression is used to specify the name of a constructed node, that expression is called the name expression of the constructor.]

[Definition: The final part of a computed constructor is an expression enclosed in braces, called the content expression of the constructor, that generates the content of the node.]

The following example illustrates the use of computed element and attribute constructors in a simple case where the names of the constructed nodes are constants. This example generates exactly the same result as the first example in 3.7.1 Direct Element Constructors:

element book { 
   attribute isbn {"isbn-0060229357" }, 
   element title { "Harold and the Purple Crayon"},
   element author { 
      element first { "Crockett" }, 
      element last {"Johnson" }
   }
}
3.7.3.1 Computed Element Constructors
[134]    CompElemConstructor    ::=    "element" (QName | ("{" Expr "}")) "{" ContentExpr? "}"
[135]    ContentExpr    ::=    Expr

[Definition: A computed element constructor creates an element node, allowing both the name and the content of the node to be computed.]

If the keyword element is followed by a QName, it is expanded using the statically known namespaces, and the resulting expanded QName is used as the node-name property of the constructed element node. If expansion of the QName is not successful, a static error is raised [err:XPST0081].

If the keyword element is followed by a name expression, the name expression is processed as follows:

  1. Atomization is applied to the value of the name expression. If the result of atomization is not a single atomic value of type xs:QName, xs:string, or xs:untypedAtomic, a type error is raised [err:XPTY0004].

  2. If the atomized value of the name expression is of type xs:QName, that expanded QName is used as the node-name property of the constructed element, retaining the prefix part of the QName.

  3. If the atomized value of the name expression is of type xs:string or xs:untypedAtomic, that value is converted to an expanded QName. If the string value contains a namespace prefix, that prefix is resolved to a namespace URI using the statically known namespaces. If the string value contains no namespace prefix, it is treated as a local name in the default element/type namespace. The resulting expanded QName is used as the node-name property of the constructed element, retaining the prefix part of the QName. If conversion of the atomized name expression to an expanded QName is not successful, a dynamic error is raised [err:XQDY0074].

The content expression of a computed element constructor (if present) is processed in exactly the same way as an enclosed expression in the content of a direct element constructor, as described in Step 1e of 3.7.1.3 Content. The result of processing the content expression is a sequence of nodes called the content sequence. If the content expression is absent, the content sequence is an empty sequence.

Processing of the computed element constructor proceeds as follows:

  1. If the content sequence contains a document node, the document node is replaced in the content sequence by its children.

  2. Adjacent text nodes in the content sequence are merged into a single text node by concatenating their contents, with no intervening blanks. After concatenation, any text node whose content is a zero-length string is deleted from the content sequence.

  3. If the content sequence contains an attribute node or a namespace node following a node that is not an attribute node or a namespace node, a type error is raised [err:XQTY0024].

  4. The properties of the newly constructed element node are determined as follows:

    1. node-name is the expanded QName resulting from processing the specified QName or name expression, as described above.

    2. parent is empty.

    3. attributes consist of all the attribute nodes in the content sequence, in implementation-dependent order. Note that the parent property of each of these attribute nodes has been set to the newly constructed element node. If two or more attributes have the same node-name, a dynamic error is raised [err:XQDY0025]. If an attribute named xml:space has a value other than preserve or default, a dynamic error MAY be raised [err:XQDY0092].

    4. children consist of all the element, text, comment, and processing instruction nodes in the content sequence. Note that the parent property of each of these nodes has been set to the newly constructed element node.

    5. base-uri is set to the following value:

      1. If the constructed node has an attribute named xml:base, then the value of this attribute, resolved if it is relative against the base URI in the static context. The value of the xml:base attribute is normalized as described in [XML Base].

      2. Otherwise, the value of the base URI in the static context.

    6. in-scope-namespaces are computed as described in 3.7.4 In-scope Namespaces of a Constructed Element.

    7. The nilled property is false.

    8. The string-value property is equal to the concatenated contents of the text-node descendants in document order.

    9. The typed-value property is equal to the string-value property, as an instance of xs:untypedAtomic.

    10. If construction mode in the static context is strip, the type-name property is xs:untyped. On the other hand, if construction mode is preserve, the type-name property is xs:anyType.

    11. The is-id and is-idrefs properties are set to false.

A computed element constructor might be used to make a modified copy of an existing element. For example, if the variable $e is bound to an element with numeric content, the following constructor might be used to create a new element with the same name and attributes as $e and with numeric content equal to twice the value of $e:

element {fn:node-name($e)}
   {$e/@*, 2 * fn:data($e)}

In this example, if $e is bound by the expression let $e := <length units="inches">{5}</length>, then the result of the example expression is the element <length units="inches">10</length>.

Note:

The static type of the expression fn:node-name($e) is xs:QName?, denoting zero or one QName. Therefore, if the Static Typing Feature is in effect, the above example raises a static type error, since the name expression in a computed element constructor is required to return exactly one string or QName. In order to avoid the static type error, the name expression fn:node-name($e) could be rewritten as fn:exactly-one(fn:node-name($e)). If the Static Typing Feature is not in effect, the example can be successfully evaluated as written, provided that $e is bound to exactly one element node with numeric content.

One important purpose of computed constructors is to allow the name of a node to be computed. We will illustrate this feature by an expression that translates the name of an element from one language to another. Suppose that the variable $dict is bound to a dictionary element containing a sequence of entry elements, each of which encodes translations for a specific word. Here is an example entry that encodes the German and Italian variants of the word "address":

<entry word="address">
   <variant xml:lang="de">Adresse</variant>
   <variant xml:lang="it">indirizzo</variant>
</entry> 

Suppose further that the variable $e is bound to the following element:

<address>123 Roosevelt Ave. Flushing, NY 11368</address>

Then the following expression generates a new element in which the name of $e has been translated into Italian and the content of $e (including its attributes, if any) has been preserved. The first enclosed expression after the element keyword generates the name of the element, and the second enclosed expression generates the content and attributes:

  element 
    {$dict/entry[@word=name($e)]/variant[@xml:lang="it"]}
    {$e/@*, $e/node()}

The result of this expression is as follows:

<indirizzo>123 Roosevelt Ave. Flushing, NY 11368</indirizzo>

Note:

As in the previous example, if the Static Typing Feature is in effect, the enclosed expression that computes the element name in the above computed element constructor must be wrapped in a call to the fn:exactly-one function in order to avoid a static type error.

Additional examples of computed element constructors can be found in I.3 Recursive Transformations.

3.7.3.2 Computed Attribute Constructors
[136]    CompAttrConstructor    ::=    "attribute" (QName | ("{" Expr "}")) "{" Expr? "}"

A computed attribute constructor creates a new attribute node, with its own node identity.

If the keyword attribute is followed by a QName, that QName is expanded using the statically known namespaces, and the resulting expanded QName (including its prefix) is used as the node-name property of the constructed attribute node. If expansion of the QName is not successful, a static error is raised [err:XPST0081].

If the keyword attribute is followed by a name expression, the name expression is processed as follows:

  1. Atomization is applied to the result of the name expression. If the result of atomization is not a single atomic value of type xs:QName, xs:string, or xs:untypedAtomic, a type error is raised [err:XPTY0004].

  2. If the atomized value of the name expression is of type xs:QName:

    1. If the expanded QName returned by the atomized name expression has a namespace URI but has no prefix, it is given an implementation-dependent prefix.

      Note:

      This step is necessary because attributes have no default namespace. Therefore any attribute name that has a namespace URI must also have a prefix.

    2. The resulting expanded QName (including its prefix) is used as the node-name property of the constructed attribute node.

  3. If the atomized value of the name expression is of type xs:string or xs:untypedAtomic, that value is converted to an expanded QName. If the string value contains a namespace prefix, that prefix is resolved to a namespace URI using the statically known namespaces. If the string value contains no namespace prefix, it is treated as a local name in no namespace. The resulting expanded QName (including its prefix) is used as the node-name property of the constructed attribute. If conversion of the atomized name expression to an expanded QName is not successful, a dynamic error is raised [err:XQDY0074].

The node-name property of the constructed attribute (an expanded QName) is checked as follows: If its URI part is http://www.w3.org/2000/xmlns/ (corresponding to namespace prefix xmlns) or if it is in no namespace and its local name is xmlns, a dynamic error [err:XQDY0044] is raised.

The content expression of a computed attribute constructor is processed as follows:

  1. Atomization is applied to the result of the content expression, converting it to a sequence of atomic values. (If the content expression is absent, the result of this step is an empty sequence.)

  2. If the result of atomization is an empty sequence, the value of the attribute is the zero-length string. Otherwise, each atomic value in the atomized sequence is cast into a string.

  3. The individual strings resulting from the previous step are merged into a single string by concatenating them with a single space character between each pair. The resulting string becomes the string-value property of the new attribute node. The type annotation (type-name property) of the new attribute node is xs:untypedAtomic. The typed-value property of the attribute node is the same as its string-value, as an instance of xs:untypedAtomic.

  4. The parent property of the attribute node is set to empty.

  5. If the attribute name is xml:id, then xml:id processing is performed as defined in [XML ID]. This ensures that the attribute node has the type xs:ID and that its value is properly normalized. If an error is encountered during xml:id processing, an implementation MAY raise a dynamic error [err:XQDY0091].

  6. If the attribute name is xml:id, the is-id property of the resulting attribute node is set to true; otherwise the is-id property is set to false. The is-idrefs property of the attribute node is unconditionally set to false.

  7. If the attribute name is xml:space and the attribute value is other than preserve or default, a dynamic error MAY be raised [err:XQDY0092].

  • Example:

    attribute size {4 +
         3}
    

    The string value of the size attribute is "7" and its type is xs:untypedAtomic.

  • Example:

    attribute { if ($sex =
         "M") then "husband" else "wife" } { <a>Hello</a>, 1
         to 3, <b>Goodbye</b> }
    

    The name of the constructed attribute is either husband or wife. Its string value is "Hello 1 2 3 Goodbye".

3.7.3.3 Document Node Constructors
[133]    CompDocConstructor    ::=    "document" "{" Expr "}"

All document node constructors are computed constructors. The result of a document node constructor is a new document node, with its own node identity.

A document node constructor is useful when the result of a query is to be a document in its own right. The following example illustrates a query that returns an XML document containing a root element named author-list:

document
   {
      <author-list>
         {fn:doc("bib.xml")/bib/book/author}
      </author-list>
   }

The content expression of a document node constructor is processed in exactly the same way as an enclosed expression in the content of a direct element constructor, as described in Step 1e of 3.7.1.3 Content. The result of processing the content expression is a sequence of nodes called the content sequence. Processing of the document node constructor then proceeds as follows:

  1. If the content sequence contains a document node, the document node is replaced in the content sequence by its children.

  2. Adjacent text nodes in the content sequence are merged into a single text node by concatenating their contents, with no intervening blanks. After concatenation, any text node whose content is a zero-length string is deleted from the content sequence.

  3. If the content sequence contains an attribute node, a type error is raised [err:XPTY0004].

  4. If the content sequence contains a namespace node, a type error is raised [err:XPTY0004].

  5. The properties of the newly constructed document node are determined as follows:

    1. base-uri is taken from base URI in the static context. If no base URI is defined in the static context, the base-uri property is empty.

    2. children consist of all the element, text, comment, and processing instruction nodes in the content sequence. Note that the parent property of each of these nodes has been set to the newly constructed document node.

    3. The unparsed-entities and document-uri properties are empty.

    4. The string-value property is equal to the concatenated contents of the text-node descendants in document order.

    5. The typed-value property is equal to the string-value property, as an instance of xs:untypedAtomic.

No validation is performed on the constructed document node. The [XML 1.0] rules that govern the structure of an XML document (for example, the document node must have exactly one child that is an element node) are not enforced by the XQuery document node constructor.

3.7.3.4 Text Node Constructors
[140]    CompTextConstructor    ::=    "text" "{" Expr "}"

All text node constructors are computed constructors. The result of a text node constructor is a new text node, with its own node identity.

The content expression of a text node constructor is processed as follows:

  1. Atomization is applied to the value of the content expression, converting it to a sequence of atomic values.

  2. If the result of atomization is an empty sequence, no text node is constructed. Otherwise, each atomic value in the atomized sequence is cast into a string.

  3. The individual strings resulting from the previous step are merged into a single string by concatenating them with a single space character between each pair. The resulting string becomes the content property of the constructed text node.

The parent property of the constructed text node is set to empty.

Note:

It is possible for a text node constructor to construct a text node containing a zero-length string. However, if used in the content of a constructed element or document node, such a text node will be deleted or merged with another text node.

The following example illustrates a text node constructor:

text {"Hello"}
3.7.3.5 Computed Processing Instruction Constructors
[142]    CompPIConstructor    ::=    "processing-instruction" (NCName | ("{" Expr "}")) "{" Expr? "}"

A computed processing instruction constructor (CompPIConstructor) constructs a new processing instruction node with its own node identity.

If the keyword processing-instruction is followed by an NCName, that NCName is used as the target property of the constructed node. If the keyword processing-instruction is followed by a name expression, the name expression is processed as follows:

  1. Atomization is applied to the value of the name expression. If the result of atomization is not a single atomic value of type xs:NCName, xs:string, or xs:untypedAtomic, a type error is raised [err:XPTY0004].

  2. If the atomized value of the name expression is of type xs:string or xs:untypedAtomic, that value is cast to the type xs:NCName. If the value cannot be cast to xs:NCName, a dynamic error is raised [err:XQDY0041].

  3. The resulting NCName is then used as the target property of the newly constructed processing instruction node. However, a dynamic error is raised if the NCName is equal to "XML" (in any combination of upper and lower case) [err:XQDY0064].

The content expression of a computed processing instruction constructor is processed as follows:

  1. Atomization is applied to the value of the content expression, converting it to a sequence of atomic values. (If the content expression is absent, the result of this step is an empty sequence.)

  2. If the result of atomization is an empty sequence, it is replaced by a zero-length string. Otherwise, each atomic value in the atomized sequence is cast into a string. If any of the resulting strings contains the string "?>", a dynamic error [err:XQDY0026] is raised.

  3. The individual strings resulting from the previous step are merged into a single string by concatenating them with a single space character between each pair. Leading whitespace is removed from the resulting string. The resulting string then becomes the content property of the constructed processing instruction node.

The remaining properties of the new processing instruction node are determined as follows:

  1. The parent property is empty.

  2. The base-uri property is empty.

The following example illustrates a computed processing instruction constructor:

let $target := "audio-output",
    $content := "beep" 
return processing-instruction {$target} {$content}

The processing instruction node constructed by this example might be serialized as follows:

<?audio-output beep?>
3.7.3.6 Computed Comment Constructors
[141]    CompCommentConstructor    ::=    "comment" "{" Expr "}"

A computed comment constructor (CompCommentConstructor) constructs a new comment node with its own node identity. The content expression of a computed comment constructor is processed as follows:

  1. Atomization is applied to the value of the content expression, converting it to a sequence of atomic values.

  2. If the result of atomization is an empty sequence, it is replaced by a zero-length string. Otherwise, each atomic value in the atomized sequence is cast into a string.

  3. The individual strings resulting from the previous step are merged into a single string by concatenating them with a single space character between each pair. The resulting string becomes the content property of the constructed comment node.

  4. It is a dynamic error [err:XQDY0072] if the result of the content expression of a computed comment constructor contains two adjacent hyphens or ends with a hyphen.

The parent property of the constructed comment node is set to empty.

The following example illustrates a computed comment constructor:

let $homebase := "Houston" 
return comment {fn:concat($homebase, ", we have a problem.")}

The comment node constructed by this example might be serialized as follows:

<!--Houston, we have a problem.-->
3.7.3.7 Computed Namespace Constructors
[137]    CompNamespaceConstructor    ::=    "namespace" (Prefix | ("{" PrefixExpr "}")) "{" URIExpr? "}"
[138]    PrefixExpr    ::=    Expr
[139]    URIExpr    ::=    Expr

A computed namespace constructor creates a new namespacee node, with its own node identity. The parent of the newly created namespace node is empty.

If the constructor specifies a Prefix, it is used as the prefix for the namespace node.

If the constructor specifies a PrefixExpr, the prefix expression is evaluated as follows: Atomization is applied to the result of the name expression. If the result of atomization a single atomic value of type xs:NCName, xs:string, or xs:untypedAtomic, it is used as the prefix property of the newly constructed namespace node. If the result is the empty sequence or an empty string, the prefix property of the newly constructed namespace node is empty. For any other result, a type error is raised [err:XPTY0004].

The URIExpr is evaluated, and the result is cast to xs:anyURI to create the URI property for the newly created node.

An error [err:XQDY0101] is raised if the namespace URI in a computed namespace constructor is bound to the predefined prefix xmlns, or if a namespace URI other than http://www.w3.org/XML/1998/namespace is bound to the prefix xml, or if the prefix xml is bound to a namespace URI other than http://www.w3.org/XML/1998/namespace.

By itself, a computed namespace constructor has no effect on in-scope namespaces, but if an element constructor's content sequence contains a namespace node, the namespace binding it represents is added to the elements in-scope namespaces.

A computed namespace constructor has no effect on the statically known namespaces.

Note:

The newly created namespace node has all properties defined for a namespace node in the data model. Like all nodes, it has identity. Like all nodes who do not share a common parent, the relative order of these nodes is implementation dependent. As defined in the data model, the name of the node is the prefix, and the string value of the node is the URI.

Examples:

  • A computed namespace constructor with a prefix:

    namespace a {"http://a.example.com" }
    
  • A computed namespace constructor with a prefix expression:

    namespace {"a"} {"http://a.example.com" }
    
  • A computed namespace constructor with an empty prefix:

    namespace { "" } {"http://a.example.com" }
    

Computed namespace constructors are generally used to add to the in-scope namespaces of elements created with element constructors:

<form>
 {
    namespace a {"http://a.example.com" },
    attribute { xs:QName("a:id") } { "a-12-XE-45" },
    element { xs:QName("a:field")} { "Sample data" }
 }
</form>

Computed namespace constructors have no effect on the statically known namespaces. If the prefix a is not already defined in the statically known namespaces, the following expression results in a static error [err:XPST0081].

<a:form>
 {
  namespace a { "http://a.example.com" }
 }
</a:form>

3.7.4 In-scope Namespaces of a Constructed Element

An element node constructed by a direct or computed element constructor has an in-scope namespaces property that consists of a set of namespace bindings. The in-scope namespaces of an element node may affect the way the node is serialized (see 2.2.4 Serialization), and may also affect the behavior of certain functions that operate on nodes, such as fn:name. Note the difference between in-scope namespaces, which is a dynamic property of an element node, and statically known namespaces, which is a static property of an expression. Also note that one of the namespace bindings in the in-scope namespaces may have no prefix (denoting the default namespace for the given element). The in-scope namespaces of a constructed element node consist of the following namespace bindings:

  • A namespace binding is created for each namespace declared in the current element constructor by a namespace declaration attribute.

  • A namespace binding is created for each namespace node in the context sequence of the current element constructor.

  • A namespace binding is created for each namespace that is declared in a namespace declaration attribute of an enclosing direct element constructor and not overridden by the current element constructor or an intermediate constructor.

  • A namespace binding is always created to bind the prefix xml to the namespace URI http://www.w3.org/XML/1998/namespace.

  • For each namespace used in the name of the constructed element or in the names of its attributes, a namespace binding must exist. If a namespace binding does not already exist for one of these namespaces, a new namespace binding is created for it. If the name of the node includes a prefix, that prefix is used in the namespace binding; if the name has no prefix, then a binding is created for the empty prefix. If this would result in a conflict, because it would require two different bindings of the same prefix, then the prefix used in the node name is changed to an arbitrary implementation-dependent prefix that does not cause such a conflict, and a namespace binding is created for this new prefix.

Note:

Copy-namespaces mode does not affect the namespace bindings of a newly constructed element node. It applies only to existing nodes that are copied by a constructor expression.

In an element constructor, if two or more namespace bindings in the in-scope bindings would have the same prefix, then an error is raised if they have different URIs [err:XQTY0102]; if they would have the same prefix and URI, duplicate bindings are ignored.

The following query serves as an example:

declare namespace p="http://example.com/ns/p";
declare namespace q="http://example.com/ns/q";
declare namespace f="http://example.com/ns/f";

<p:a q:b="{f:func(2)}" xmlns:r="http://example.com/ns/r"/>

The in-scope namespaces of the resulting p:a element consists of the following namespace bindings:

  • p = "http://example.com/ns/p"

  • q = "http://example.com/ns/q"

  • r = "http://example.com/ns/r"

  • xml = "http://www.w3.org/XML/1998/namespace"

The namespace bindings for p and q are added to the result element because their respective namespaces are used in the names of the element and its attributes. The namespace binding r="http://example.com/ns/r" is added to the in-scope namespaces of the constructed element because it is defined by a namespace declaration attribute, even though it is not used in a name.

No namespace binding corresponding to f="http://example.com/ns/f" is created, because the namespace prefix f appears only in the query prolog and is not used in an element or attribute name of the constructed node. This namespace binding does not appear in the query result, even though it is present in the statically known namespaces and is available for use during processing of the query.

Note that the following constructed element, if nested within a validate expression, cannot be validated:

<p xsi:type="xs:integer">3</p>

The constructed element will have namespace bindings for the prefixes xsi (because it is used in a name) and xml (because it is defined for every constructed element node). During validation of the constructed element, the validator will be unable to interpret the namespace prefix xs because it is has no namespace binding. Validation of this constructed element could be made possible by providing a namespace declaration attribute, as in the following example:

<p xmlns:xs="http://www.w3.org/2001/XMLSchema"
   xsi:type="xs:integer">3</p>

3.8 FLWOR Expressions

XQuery provides a versatile expression called a FLWOR expression that may contain multiple clauses. The FLWOR expression can be used for many purposes, including iterating over sequences, joining multiple documents, and performing grouping and aggregation. The name FLWOR, pronounced "flower", is suggested by the keywords for, let, where, order by, and return, which introduce some of the clauses used in FLWOR expressions (but this is not a complete list of such clauses.)

The complete syntax of a FLWOR expression is shown here, and relevant parts of the syntax are repeated in subsequent sections of this document.

[40]    FLWORExpr    ::=    InitialClause IntermediateClause* ReturnClause
[41]    InitialClause    ::=    ForClause | LetClause | WindowClause
[42]    IntermediateClause    ::=    InitialClause | WhereClause | GroupByClause | OrderByClause | CountClause
[43]    ForClause    ::=    "outer"? "for" "$" VarName TypeDeclaration? PositionalVar? "in" ExprSingle ("," "$" VarName TypeDeclaration? PositionalVar? "in" ExprSingle)*
[45]    LetClause    ::=    "let" "$" VarName TypeDeclaration? ":=" ExprSingle ("," "$" VarName TypeDeclaration? ":=" ExprSingle)*
[144]    TypeDeclaration    ::=    "as" SequenceType
[44]    PositionalVar    ::=    "at" "$" VarName
[46]    WindowClause    ::=    "for" (TumblingWindowClause | SlidingWindowClause)
[47]    TumblingWindowClause    ::=    "tumbling" "window" "$" VarName TypeDeclaration? "in" ExprSingle WindowStartCondition WindowEndCondition?
[48]    SlidingWindowClause    ::=    "sliding" "window" "$" VarName TypeDeclaration? "in" ExprSingle WindowStartCondition WindowEndCondition
[49]    WindowStartCondition    ::=    "start" WindowVars "when" ExprSingle
[50]    WindowEndCondition    ::=    "only"? "end" WindowVars "when" ExprSingle
[51]    WindowVars    ::=    ("$" CurrentItem)? PositionalVar? ("previous" "$" PreviousItem)? ("next" "$" NextItem)?
[52]    CurrentItem    ::=    QName
[53]    PreviousItem    ::=    QName
[54]    NextItem    ::=    QName
[55]    CountClause    ::=    "count" "$" VarName
[56]    WhereClause    ::=    "where" ExprSingle
[57]    GroupByClause    ::=    "group" "by" GroupingSpecList
[58]    GroupingSpecList    ::=    GroupingSpec ("," GroupingSpec)*
[59]    GroupingSpec    ::=    "$" VarName ("collation" URILiteral)?
[60]    OrderByClause    ::=    (("order" "by") | ("stable" "order" "by")) OrderSpecList
[61]    OrderSpecList    ::=    OrderSpec ("," OrderSpec)*
[62]    OrderSpec    ::=    ExprSingle OrderModifier
[63]    OrderModifier    ::=    ("ascending" | "descending")? ("empty" ("greatest" | "least"))? ("collation" URILiteral)?
[64]    ReturnClause    ::=    "return" ExprSingle

The semantics of FLWOR expressions are based on a concept called a tuple stream. [Definition: A tuple stream is an ordered sequence of zero or more tuples.] [Definition: A tuple is a set of zero or more named variables, each of which is bound to a value that is an XDM instance.] Each tuple stream is homogeneous in the sense that all its tuples contain variables with the same names and the same static types. The following example illustrates a tuple stream consisting of four tuples, each containing three variables named $x, $y, and $z:

($x = 1003, $y = "Fred", $z = <age>21</age>)
($x = 1017, $y = "Mary", $z = <age>35</age>)
($x = 1020, $y = "Bill", $z = <age>18</age>)
($x = 1024, $y = "John", $z = <age>29</age>)

Note:

In this section, tuple streams are represented as shown in the above example. Each tuple is on a separate line and is enclosed in parentheses, and the variable bindings inside each tuple are separated by commas. This notation does not represent XQuery syntax, but is simply a representation of a tuple stream for the purpose of defining the semantics of FLWOR expressions.

Tuples and tuple streams are not part of the data model. They exist only as conceptual intermediate results during the processing of a FLWOR expression.

A FLWOR expression consists of an initial clause, zero or more intermediate clauses, and a final clause. Conceptually, the initial clause generates a tuple stream. Each intermediate clause takes the tuple stream generated by the previous clause as input and generates a (possibly different) tuple stream as output. The final clause takes a tuple stream as input and, for each tuple in this tuple stream, generates an XDM instance; the final result of the FLWOR expression is the ordered concatenation of these XDM instances.

The initial clause in a FLWOR expression may be a for, let, window, or count clause. Intermediate clauses may be for, let, window, count, where, group by, or order by clauses. These intermediate clauses may be repeated as many times as desired, in any order. The final clause of the FLWOR expression must be a return clause. The semantics of the various clauses are described in the following sections.

3.8.1 Variable Bindings

The following clauses in FLWOR expressions bind values to variables: for, let, window, and count (in addition, a group by clause changes the values of variables that were previously bound.) In each case, binding of variables is governed by the following rules:

  1. The scope of a bound variable includes all subexpressions of the containing FLWOR that appear after the variable binding. The scope does not include the expression to which the variable is bound. The following code fragment, containing two let clauses, illustrates how variable bindings may reference variables that were bound in earlier clauses, or in earlier bindings in the same clause:

    let $x := 47, $y := f($x)
    let $z := g($x, $y)
    
  2. A given variable may be bound more than once in a FLWOR expression, or even within one clause of a FLWOR expression. In such a case, each new binding occludes the previous one, which becomes inaccessible in the remainder of the FLWOR expression.

  3. [Definition: A variable binding may be accompanied by a type declaration, which consists of the keyword as followed by the static type of the variable, declared using the syntax in 2.5.3 SequenceType Syntax.] At run time, if the value bound to the variable does not match the declared type according to the rules for SequenceType matching, a type error is raised [err:XPTY0004]. For example, the following let clause raises a type error because the variable $salary has a type declaration that is not satisfied by the value that is bound to it:

    let $salary as xs:decimal :=  "cat"
    
  4. [Definition: In a for clause or window clause, when an expression is preceded by the keyword in, the value of that expression is called a binding sequence.] The for and window clauses iterate over their binding sequences, producing multiple bindings for one or more variables. Details on how binding sequences are used in for and window clauses are described in the following sections.

3.8.2 For Clause

[43]    ForClause    ::=    "outer"? "for" "$" VarName TypeDeclaration? PositionalVar? "in" ExprSingle ("," "$" VarName TypeDeclaration? PositionalVar? "in" ExprSingle)*
[144]    TypeDeclaration    ::=    "as" SequenceType
[44]    PositionalVar    ::=    "at" "$" VarName

A for clause is used for iteration. Each variable in a for clause iterates over a sequence and is bound in turn to each item in the sequence.

If a for clause contains multiple variables, it is semantically equivalent to multiple for clauses, each containing one of the variables in the original for clause. In each of the semantically equivalent single-variable for clauses, the presence or absence of the outer keyword is the same as in the original for clause.

Examples:

  • The clause

    for $x in $expr1, $y in $expr2
    

    is semantically equivalent to:

    for $x in $expr1 
    for $y in $expr2
    
  • The clause

    outer for $x in $expr1, $y in $expr2
    

    is semantically equivalent to:

    outer for $x in $expr1 
    outer for $y in $expr2
    

In the remainder of this section, we define the semantics of a for clause containing a single variable and an associated expression (following the keyword in) whose value is called the binding sequence for that variable.

If a single-variable for clause is the initial clause in a FLWOR expression, it iterates over its binding sequence, binding the variable to each item in turn. The resulting sequence of variable bindings becomes the initial tuple stream that serves as input to the next clause of the FLWOR expression. If ordering mode is ordered, the order of tuples in the tuple stream preserves the order of the binding sequence; otherwise the order of the tuple stream is implementation-dependent.

If the binding sequence contains no items, the output tuple stream depends on the presence or absence of the outer keyword. If outer is specified, the output tuple stream consists of one tuple in which the variable is bound to an empty sequence. If outer is not specified, the output tuple stream consists of zero tuples.

The following examples illustrates tuple streams that are generated by initial for clauses:

  • Initial clause:

    for $x in (100, 200, 300)
    

    or (equivalently):

    outer for $x in (100, 200, 300)
    

    Output tuple stream:

    ($x = 100)
    ($x = 200)
    ($x = 300)
    
  • Initial clause:

    for $x in ()
    

    Output tuple stream contains no tuples.

  • Initial clause:

    outer for $x in ()
    

    Output tuple stream:

    ($x = ())
    

[Definition: A positional variable is a variable that is preceded by the keyword at.] A positional variable may be associated with a variable that is bound in a for clause. In this case, as the main variable iterates over the items in its binding sequence, the positional variable iterates over the integers that represent the ordinal numbers of these items in the binding sequence, starting with one. Each tuple in the output tuple stream contains bindings for both the main variable and the positional variable. If the binding sequence is empty and outer is specified, the positional variable in the output tuple is bound to the integer zero. Positional variables always have the implied type xs:integer. The expanded QName of a positional variable must be distinct from the expanded QName of the main variable with which it is associated [err:XQST0089].

The following examples illustrate how a positional variable would have affected the results of the previous examples that generated tuples:

  • Initial clause:

    for $x at $i in (100, 200, 300)
    

    Output tuple stream:

    ($x = 100, $i = 1)
    ($x = 200, $i = 2)
    ($x = 300, $i = 3)
    
  • Initial clause:

    outer for $x at $i in ()
    

    Output tuple stream:

    ($x = (), $i = 0)
    

If a single-variable for clause is an intermediate clause in a FLWOR expression, its binding sequence is evaluated for each input tuple, given the bindings in that input tuple. Each input tuple generates zero or more tuples in the output tuple stream. Each of these output tuples consists of the original variable bindings of the input tuple plus a binding of the new variable to one of the items in its binding sequence.

Note:

Although the binding sequence is conceptually evaluated independently for each input tuple, an optimized implementation may sometimes be able to avoid re-evaluating the binding sequence if it can show that the variables that the binding sequence depends on have the same values as in a previous evaluation.

For a given input tuple, if the binding sequence for the new variable in the for clause contains no items, the result depends on the presence or absence of the outer keyword. If outer is specified, the input tuple generates one output tuple, with the original variable bindings plus a binding of the new variable to an empty sequence. If outer is not specified, the input tuple generates zero output tuples (it is not represented in the output tuple stream.)

If the new variable introduced by a for clause has an associated positional variable, the output tuples generated by the for clause also contain bindings for the positional variable. In this case, as the new variable is bound to each item in its binding sequence, the positional variable is bound to the ordinal position of that item within the binding sequence, starting with one. Note that, since the positional variable represents a position within a binding sequence, the output tuples corresponding to each input tuple are independently numbered, starting with one. For a given input tuple, if the binding sequence is empty and outer is specified, the positional variable in the output tuple is bound to the integer zero.

If ordering mode is ordered, the tuples in the output tuple stream are ordered primarily by the order of the input tuples from which they are derived, and secondarily by the order of the binding sequence for the new variable; otherwise the order of the output tuple stream is implementation-dependent.

The following examples illustrates the effects of intermediate for clauses:

  • Input tuple stream:

    ($x = 1)
    ($x = 2)
    ($x = 3)
    ($x = 4)
    

    Intermediate for clause:

    for $y in ($x to 3)
    

    Output tuple stream (assuming ordering mode is ordered):

    ($x = 1, $y = 1)
    ($x = 1, $y = 2)
    ($x = 1, $y = 3)
    ($x = 2, $y = 2)
    ($x = 2, $y = 3)
    ($x = 3, $y = 3)
    

    Note:

    In this example, there is no output tuple that corresponds to the input tuple ($x = 4) because, when the for clause is evaluated with the bindings in this input tuple, the resulting binding sequence for $y is empty.

  • This example shows how the previous example would have been affected by a positional variable (assuming the same input tuple stream):

    for $y at $j in ($x to 3)
    

    Output tuple stream (assuming ordering mode is ordered):

    ($x = 1, $y = 1, $j = 1)
    ($x = 1, $y = 2, $j = 2)
    ($x = 1, $y = 3, $j = 3)
    ($x = 2, $y = 2, $j = 1)
    ($x = 2, $y = 3, $j = 2)
    ($x = 3, $y = 3, $j = 1)
    
  • This example shows how the previous example would have been affected by the outer keyword. Note that the outer keyword causes the input tuple ($x = 4) to be represented in the output tuple stream, even though the binding sequence for $y contains no items for this input tuple. This example illustrates that the outer keyword in a for clause serves a purpose similar to that of an "outer join" in a relational database query. (Assume the same input tuple stream as in the previous example.)

    outer for $y at $j in ($x to 3)
    

    Output tuple stream (assuming ordering mode is ordered):

    ($x = 1, $y = 1, $j = 1)
    ($x = 1, $y = 2, $j = 2)
    ($x = 1, $y = 3, $j = 3)
    ($x = 2, $y = 2, $j = 1)
    ($x = 2, $y = 3, $j = 2)
    ($x = 3, $y = 3, $j = 1)
    ($x = 4, $y = (), $j = 0)
    
  • This example shows how a for clause that binds two variables is semantically equivalent to two for clauses that bind one variable each. We assume that this for clause occurs at the beginning of a FLWOR expression. It is equivalent to an initial single-variable for clause that provides an input tuple stream to an intermediate single-variable for clause.

    for $x in (1, 2, 3, 4), $y in ($x to 3)
    

    Output tuple stream (assuming ordering mode is ordered):

    ($x = 1, $y = 1)
    ($x = 1, $y = 2)
    ($x = 1, $y = 3)
    ($x = 2, $y = 2)
    ($x = 2, $y = 3)
    ($x = 3, $y = 3)
    

In the above examples, if ordering mode had been unordered, the output tuple streams would have consisted of the same tuples, with the same values for the positional variables, but the ordering of the tuples would have been implementation-dependent.

A for clause may contain one or more type declarations, identified by the keyword as. The semantics of type declarations are defined in 3.8.1 Variable Bindings.

3.8.3 Let Clause

[45]    LetClause    ::=    "let" "$" VarName TypeDeclaration? ":=" ExprSingle ("," "$" VarName TypeDeclaration? ":=" ExprSingle)*
[144]    TypeDeclaration    ::=    "as" SequenceType

The purpose of a let clause is to bind values to one or more variables. Each variable is bound to the result of evaluating an expression.

If a let clause contains multiple variables, it is semantically equivalent to multiple let clauses, each containing a single variable. For example, the clause

let $x := $expr1, $y := $expr2

is semantically equivalent to the following sequence of clauses:

let $x := $expr1 
let $y := $expr2

In the remainder of this section, we define the semantics of a let clause containing a single variable V and an associated expression E.

If a single-variable let clause is the initial clause in a FLWOR expression, it simply binds the variable V to the result of the expression E. The result of the let clause is a tuple stream consisting of one tuple with a single binding that binds V to the result of E. This tuple stream serves as input to the next clause in the FLWOR expression.

If a single-variable let clause is an intermediate clause in a FLWOR expression, it adds a new binding for variable V to each tuple in the input tuple stream. For each input tuple, the value bound to V is the result of evaluating expression E, given the bindings that are already present in that input tuple. The resulting tuples become the output tuple stream of the let clause.

The number of tuples in the output tuple stream of an intermediate let clause is the same as the number of tuples in the input tuple stream. The number of bindings in the output tuples is one more than the number of bindings in the input tuples, unless the input tuples already contain bindings for V; in this case, the new binding for V occludes (replaces) the earlier binding for V, and the number of bindings is unchanged.

A let clause may contain one or more type declarations, identified by the keyword as. The semantics of type declarations are defined in 3.8.1 Variable Bindings.

The following code fragment illustrates how a for clause and a let clause can be used together. The for clause produces an initial tuple stream containing a binding for variable $d to each department number found in a given input document. The let clause adds an additional binding to each tuple, binding variable $e to a sequence of employees whose department number matches the value of $d in that tuple.

for $d in fn:doc("depts.xml")/depts/deptno
let $e := fn:doc("emps.xml")/emps/emp[deptno eq $d]

3.8.4 Window Clause

[46]    WindowClause    ::=    "for" (TumblingWindowClause | SlidingWindowClause)
[47]    TumblingWindowClause    ::=    "tumbling" "window" "$" VarName TypeDeclaration? "in" ExprSingle WindowStartCondition WindowEndCondition?
[48]    SlidingWindowClause    ::=    "sliding" "window" "$" VarName TypeDeclaration? "in" ExprSingle WindowStartCondition WindowEndCondition
[49]    WindowStartCondition    ::=    "start" WindowVars "when" ExprSingle
[50]    WindowEndCondition    ::=    "only"? "end" WindowVars "when" ExprSingle
[51]    WindowVars    ::=    ("$" CurrentItem)? PositionalVar? ("previous" "$" PreviousItem)? ("next" "$" NextItem)?
[52]    CurrentItem    ::=    QName
[44]    PositionalVar    ::=    "at" "$" VarName
[53]    PreviousItem    ::=    QName
[54]    NextItem    ::=    QName

Like a for clause, a window clause iterates over its binding sequence and generates a sequence of tuples. In the case of a window clause, each tuple represents a window. [Definition: A window is a sequence of consecutive items drawn from the binding sequence.] Each window is represented by at least one and at most nine bound variables. The variables have user-specified names, but their roles are as follows:

  • Window-variable: Bound to the sequence of items from the binding sequence that comprise the window.

  • Start-item: (Optional) Bound to the first item in the window.

  • Start-item-position: (Optional) Bound to the ordinal position of the first window item in the binding sequence. Start-item-position is a positional variable. Its type is xs:integer, and its expanded QName must be distinct from the expanded QName of start-item [err:XQST0089].

  • Start-previous-item: (Optional) Bound to the item in the binding sequence that precedes the first item in the window (empty sequence if none).

  • Start-next-item: (Optional) Bound to the item in the binding sequence that follows the first item in the window (empty sequence if none).

  • End-item: (Optional) Bound to the last item in the window.

  • End-item-position: (Optional) Bound to the ordinal position of the last window item in the binding sequence. End-item-position is a positional variable. Its type is xs:integer, and its expanded QName must be distinct from the expanded QName of end-item [err:XQST0089].

  • End-previous-item: (Optional) Bound to the item in the binding sequence that precedes the last item in the window (empty sequence if none).

  • End-next-item: (Optional) Bound to the item in the binding sequence that follows the last item in the window (empty sequence if none).

All variables in a window clause must have distinct names; otherwise a static error is raised [err:XQST0103].

The following is an example of a window clause that binds nine variables to the roles listed above. In this example, the variables are named $w, $s, $spos, $sprev, $snext, $e, $epos, $eprev, and $enext respectively. A window clause always binds the window variable, but typically binds only a subset of the other variables.

for tumbling window $w in (2, 4, 6, 8, 10)
start $s at $spos previous $sprev next $snext when true() end $e at
$epos previous $eprev next $enext when true()

Windows are created by iterating over the items in the binding sequence, in order, identifying the start item and the end item of each window by evaluating the WindowStartCondition and the WindowEndCondition. Each of these conditions is satisfied if the effective boolean value of the expression following the when keyword is true. The start item of the window is an item that satisfies the WindowStartCondition (see 3.8.4.1 Tumbling Windows and 3.8.4.2 Sliding Windows for a more complete explanation.) The end item of the window is the first item in the binding sequence, beginning with the start item, that satisfies the WindowEndCondition (again, see 3.8.4.1 Tumbling Windows and 3.8.4.2 Sliding Windows for more details.) Each window contains its start item, its end item, and all items that occur between them in the binding sequence. If the end item is the start item, then the window contains only one item. If a start item is identified, but no following item in the binding sequence satisfies the WindowEndCondition, then the only keyword determines whether a window is generated: if only end is specified, then no window is generated; otherwise, the end item is set to the last item in the binding sequence and a window is generated.

In the above example, the WindowStartCondition and WindowEndCondition are both true(), which causes each tuple in the binding sequence to be in a separate window. Typically, the WindowStartCondition and WindowEndCondition are expressed in terms of bound variables. For example, the following WindowStartCondition might be used to start a new window for every item in the binding sequence that is larger than both the previous item and the following item:

start $s previous $sprev next $snext 
   when $s > $sprev and $s > $snext

The scoping rules for the variables bound by a window clause are as follows:

  • In the when-expression of the WindowStartCondition, the following variables (identified here by their roles) are in scope (if bound): start-item, start-item-position, start-previous-item, start-next-item.

  • In the when-expression of the WindowEndCondition, the following variables (identified here by their roles) are in scope (if bound): start-item, start-item-position, start-previous-item, start-next-item, end-item, end-item-position, end-previous-item, end-next-item.

  • In the clauses of the FLWOR expression that follow the window clause, all nine of the variables bound by the window clause (including window-variable) are in scope (if bound).

In a window clause, the keyword tumbling or sliding determines the way in which the starting item of each window is identified, as explained in the following sections.

3.8.4.1 Tumbling Windows

If the window type is tumbling, then windows never overlap. The search for the start of the first window begins at the beginning of the binding sequence. After each window is generated, the search for the start of the next window begins with the item in the binding sequence that occurs after the ending item of the last generated window. Thus, no item that occurs in one window can occur in another window drawn from the same binding sequence. In a tumbling window clause, the end clause is optional; if it is omitted, the start clause is applied to identify all potential starting items in the binding sequence, and a window is constructed for each starting item, including all items from that starting item up to the item before the next window's starting item, or the end of the binding sequence, whichever comes first.

The following examples illustrate the use of tumbling windows.

  • Show non-overlapping windows of three items.

    for tumbling window $w in (2, 4, 6, 8, 10, 12, 14)
        start at $s when fn:true()
        only end at $e when $e - $s eq 2
    return <window>{ $w }</window>
    

    Result of the above query:

    <window>2 4 6</window>
    <window>8 10 12</window>
    
  • Show averages of non-overlapping three-item windows.

    for tumbling window $w in (2, 4, 6, 8, 10, 12, 14)
        start at $s when fn:true()
        only end at $e when $e - $s eq 2
    return avg($w)
    

    Result of the above query:

    4 10
    
  • Show first and last items in each window of three items.

    for tumbling window $w in (2, 4, 6, 8, 10, 12, 14)
        start $first at $s when fn:true()
        only end $last at $e when $e - $s eq 2
    return <window>{ $first, $last }</window>
    

    Result of the above query:

    <window>2 6</window>
    <window>8 12</window>
    
  • Show non-overlapping windows of up to three items (illustrates end clause without the only keyword).

    for tumbling window $w in (2, 4, 6, 8, 10, 12, 14)
        start at $s when fn:true()
        end at $e when $e - $s eq 2
    return <window>{ $w }</window>
    

    Result of the above query:

    <window>2 4 6</window>
    <window>8 10 12</window>
    <window>14</window>
    
  • Show non-overlapping windows of up to three items (illustrates use of start without explicit end).

    for tumbling window $w in (2, 4, 6, 8, 10, 12, 14)
        start at $s when $s mod 3 = 1
    return <window>{ $w }</window>
    

    Result of the above query:

    <window>2 4 6</window>
    <window>8 10 12</window>
    <window>14</window>
    
  • Show non-overlapping sequences starting with a number divisible by 3.

    for tumbling window $w in (2, 4, 6, 8, 10, 12, 14)
        start $first when $first mod 3 = 0
    return <window>{ $w }</window>
    

    Result of the above query:

    <window>6 8 10</window>
    <window>12 14</window>
    
3.8.4.2 Sliding Windows

If the window type is sliding window, then windows may overlap. Every item in the binding sequence that satisfies the WindowStartCondition is the starting item of a new window. Thus, a given item may be found in multiple windows drawn from the same binding sequence.

The following examples illustrate the use of sliding windows.

  • Show windows of three items.

    for sliding window $w in (2, 4, 6, 8, 10, 12, 14)
        start at $s when fn:true()
        only end at $e when $e - $s eq 2
    return <window>{ $w }</window>
    

    Result of the above query:

    <window>2 4 6</window>
    <window>4 6 8</window>
    <window>6 8 10</window>
    <window>8 10 12</window>
    <window>10 12 14</window>
    
  • Show moving averages of three items.

    for sliding window $w in (2, 4, 6, 8, 10, 12, 14)
        start at $s when fn:true()
        only end at $e when $e - $s eq 2
    return avg($w)
    

    Result of the above query:

    4 6 8 10 12
    
  • Show overlapping windows of up to three items (illustrates end clause without the only keyword).

    for sliding window $w in (2, 4, 6, 8, 10, 12, 14)
        start at $s when fn:true()
        end at $e when $e - $s eq 2
    return <window>{ $w }</window>
    

    Result of the above query:

    <window>2 4 6</window>
    <window>4 6 8</window>
    <window>6 8 10</window>
    <window>8 10 12</window>
    <window>10 12 14</window>
    <window>12 14</window>
    <window>14</window>
    
3.8.4.3 Effects of Window Clauses on the Tuple Stream

The effects of a window clause on the tuple stream are similar to the effects of a for clause. As described in 3.8.4 Window Clause, a window clause generates zero or more windows, each of which is represented by at least one and at most nine bound variables.

If the window clause is the initial clause in a FLWOR expression, the bound variables that describe each window become an output tuple. These tuples form the initial tuple stream that serves as input to the next clause of the FLWOR expression. If ordering mode is ordered, the order of tuples in the tuple stream is the order in which their start items appear in the binding sequence; otherwise the order of the tuple stream is implementation-dependent. The cardinality of the tuple stream is equal to the number of windows.

If a window clause is an intermediate clause in a FLWOR expression, each input tuple generates zero or more output tuples, each consisting of the original bound variables of the input tuple plus the new bound variables that represent one of the generated windows. For each tuple T in the input tuple stream, the output tuple stream will contain NT tuples, where NT is the number of windows generated by the window clause, given the bindings in the input tuple T. Input tuples for which no windows are generated are not represented in the output tuple stream. If ordering mode is ordered, the order of tuples in the output stream is determined primarily by the order of the input tuples from which they were derived, and secondarily by the order in which their start items appear in the binding sequence. If ordering mode is unordered, the order of tuples in the output stream is implementation-dependent.

The following example illustrates a window clause that is the initial clause in a FLWOR expression. The example is based on input data that consists of a sequence of closing stock prices for a specific company. For this example we assume the following input data (assume that the price elements have a validated type of xs:decimal):

<stock>
  <closing> <date>2008-01-01</date> <price>105</price> </closing
  <closing> <date>2008-01-02</date> <price>101</price> </closing
  <closing> <date>2008-01-03</date> <price>102</price> </closing
  <closing> <date>2008-01-04</date> <price>103</price> </closing
  <closing> <date>2008-01-05</date> <price>102</price> </closing
  <closing> <date>2008-01-06</date> <price>104</price> </closing
</stock>

A user wishes to find "run-ups," which are defined as sequences of dates that begin with a "low" and end with a "high" price (that is, the stock price begins to rise on the first day of the run-up, and continues to rise or remain even through the last day of the run-up.) The following query uses a tumbling window to find run-ups in the input data:

for tumbling window $w in //closing
   start $first next $second when $first/price < $second/price
   end $last next $beyond when $last/price > $beyond/price
return
   <run-up>
      <start-date>{fn:data($first/date)}</start-date>
      <start-price>{fn:data($first/price)}</start-price>
      <end-date>{fn:data($last/date)}</end-date>
      <end-price>{fn:data($last/price)}</end-price>
   </run-up>

For our sample input data, this tumbling window clause generates a tuple stream consisting of two tuples, each representing a window and containing five bound variables named $w, $first, $second, $last, and $beyond. The return clause is evaluated for each of these tuples, generating the following query result:

<run-up>
   <start-date>2008-01-02</start-date>
   <start-price>101</start-price>
   <end-date>2008-01-04</start-date>
   <end-price>103</end-price>
</run-up>
<run-up>
   <start-date>2008-01-05</start-date>
   <start-price>102</start-price>
   <end-date>2008-01-06</start-date>
   <end-price>104</end-price>
</run-up>

The following example illustrates a window clause that is an intermediate clause in a FLWOR expression. In this example, the input data contains closing stock prices for several different companies, each identified by a three-letter symbol. We assume the following input data (again assuming that the type of the price element is xs:decimal):

<stocks>
  <closing> <symbol>ABC</symbol> <date>2008-01-01</date> <price>105</price> </closing>
  <closing> <symbol>DEF</symbol> <date>2008-01-01</date> <price>057</price> </closing>
  <closing> <symbol>ABC</symbol> <date>2008-01-02</date> <price>101</price> </closing>
  <closing> <symbol>DEF</symbol> <date>2008-01-02</date> <price>054</price> </closing>
  <closing> <symbol>ABC</symbol> <date>2008-01-03</date> <price>102</price> </closing>
  <closing> <symbol>DEF</symbol> <date>2008-01-03</date> <price>056</price> </closing>
  <closing> <symbol>ABC</symbol> <date>2008-01-04</date> <price>103</price> </closing>
  <closing> <symbol>DEF</symbol> <date>2008-01-04</date> <price>052</price> </closing>
  <closing> <symbol>ABC</symbol> <date>2008-01-05</date> <price>101</price> </closing>
  <closing> <symbol>DEF</symbol> <date>2008-01-05</date> <price>055</price> </closing>
  <closing> <symbol>ABC</symbol> <date>2008-01-06</date> <price>104</price> </closing>
  <closing> <symbol>DEF</symbol> <date>2008-01-06</date> <price>059</price> </closing>
</stocks>

As in the previous example, we want to find "run-ups," which are defined as sequences of dates that begin with a "low" and end with a "high" price for a specific company. In this example, however, the input data consists of stock prices for multiple companies. Therefore it is necessary to isolate the stock prices of each company before forming windows. This can be accomplished by an initial for and let clause, followed by a window clause, as follows:

for $symbol in fn:distinct-values(//symbol)
let $closings := //closing[symbol = $symbol]
for tumbling window $w in $closings
   start $first next $second when $first/price < $second/price
   end $last next $beyond when $last/price > $beyond/price
return
   <run-up symbol="{$symbol}">
      <start-date>{fn:data($first/date)}</start-date>
      <start-price>{fn:data($first/price)}</start-price>
      <end-date>{fn:data($last/date)}</end-date>
      <end-price>{fn:data($last/price)}</end-price>
   </run-up>

Note:

In the above example, the for and let clauses could be rewritten as follows:

for $closings in //closing
let $symbol := $closings/symbol
group by $symbol

The group by clause is described in 3.8.7 Group By Clause.

The for and let clauses in this query generate an initial tuple stream consisting of two tuples. In the first tuple, $symbol is bound to "ABC" and $closings is bound to the sequence of closing elements for company ABC. In the second tuple, $symbol is bound to "DEF" and $closings is bound to the sequence of closing elements for company DEF.

The window clause operates on this initial tuple stream, generating two windows for the first tuple and two windows for the second tuple. The result is a tuple stream consisting of four tuples, each with the following bound variables: $symbol, $closings, $w, $first, $second, $last, and $beyond. The return clause is then evaluated for each of these tuples, generating the following query result:

<run-up symbol="ABC">
   <start-date>2008-01-02</start-date>
   <start-price>101</start-price>
   <end-date>2008-01-04</start-date>
   <end-price>103</end-price>
</run-up>
<run-up symbol="ABC">
   <start-date>2008-01-05</start-date>
   <start-price>101</start-price>
   <end-date>2008-01-06</start-date>
   <end-price>104</end-price>
</run-up>
<run-up symbol="DEF">
   <start-date>2008-01-02</start-date>
   <start-price>54</start-price>
   <end-date>2008-01-03</start-date>
   <end-price>56</end-price>
</run-up>
<run-up symbol="DEF">
   <start-date>2008-01-04</start-date>
   <start-price>52</start-price>
   <end-date>2008-01-06</start-date>
   <end-price>59</end-price>
</run-up>

3.8.5 Where Clause

[56]    WhereClause    ::=    "where" ExprSingle

A where clause serves as a filter for the tuples in its input tuple stream. The expression in the where clause, called the where-expression, is evaluated once for each of these tuples. If the effective boolean value of the where-expression is true, the tuple is retained in the output tuple stream; otherwise the tuple is discarded.

Examples:

  • This example illustrates the effect of a where clause on a tuple stream:

    Input tuple stream:

    ($a = 5, $b = 11)
    ($a = 91, $b = 42)
    ($a = 17, $b = 30)
    ($a = 85, $b = 63)
    

    where clause:

    where $a > $b
    

    Output tuple stream:

    ($a = 91, $b = 42)
    ($a = 85, $b = 63)
    
  • The following query illustrates how a where clause might be used with a positional variable to perform sampling on an input sequence. The query returns one value out of each one hundred input values.

    for $x at $i in $inputvalues
        where $i mod 100 = 0   
        return $x
    

3.8.6 Count Clause

[55]    CountClause    ::=    "count" "$" VarName

The purpose of a count clause is to enhance the tuple stream with a new variable that is bound, in each tuple, to the ordinal position of that tuple in the tuple stream. The name of the new variable is specified in the count clause.

The output tuple stream of a count clause is the same as its input tuple stream, with each tuple enhanced by one additional variable that is bound to the ordinal position of that tuple in the tuple stream. However, if the name of the new variable is the same as the name of an existing variable in the input tuple stream, the new variable occludes (replaces) the existing variable of the same name, and the number of bound variables in each tuple is unchanged.

The following examples illustrate uses of the count clause:

  • This example illustrates the effect of a count clause on an input tuple stream:

    Input tuple stream:

    ($name = "Bob", $age = 21)
    ($name = "Carol", $age = 19)
    ($name = "Ted", $age = 20)
    ($name = "Alice", $age = 22)
    

    count clause:

    count $counter
    

    Output tuple stream:

    ($name = "Bob", $age = 21, $counter = 1)
    ($name = "Carol", $age = 19, $counter = 2)
    ($name = "Ted", $age = 20, $counter = 3)
    ($name = "Alice", $age = 22, $counter = 4)
    
  • This example illustrates how a counter might be used to filter the result of a query. The query ranks products in order by decreasing sales, and returns the three products with the highest sales. Assume that the variable $products is bound to a sequence of product elements, each of which has name and sales child-elements.

    for $p in $products
    order by $p/sales descending
    count $rank
    where $rank <= 3
    return
       <product rank="{$rank}">
          {$p/name, $p/sales}
       </product>
    

    The result of this query has the following structure:

    <product rank="1">
       <name>Toaster</name>
       <sales>968</sales>
    </product>
    <product rank="2">
       <name>Blender</name>
       <sales>520</sales>
    </product>
    <product rank="3">
       <name>Can Opener</name>
       <sales>475</sales>
    </product>
    

3.8.7 Group By Clause

[57]    GroupByClause    ::=    "group" "by" GroupingSpecList
[58]    GroupingSpecList    ::=    GroupingSpec ("," GroupingSpec)*
[59]    GroupingSpec    ::=    "$" VarName ("collation" URILiteral)?

A group by clause generates an output tuple stream in which each tuple represents a group of tuples from the input tuple stream. We will refer to the tuples in the input tuple stream as pre-grouping tuples, and the tuples in the output tuple stream as post-grouping tuples.

The post-grouping tuples have exactly the same variable-names as the pre-grouping tuples. The number of post-grouping tuples is less than or equal to the number of pre-grouping tuples. The group by clause assigns each pre-grouping tuple to a group, and generates one post-grouping tuple for each group. Subsequent clauses in the FLWOR expression see only the variable bindings in the post-grouping tuples; they no longer have access to the variable bindings in the pre-grouping tuples.

[Definition: A group by clause consists of the keywords group by followed by one or more variables called grouping variables.] The name of each grouping variable must be equal (by the eq operator on expanded QNames) to the name of a bound variable in the input tuple stream; otherwise a static error is raised [err:XQST0094]. The process of group formation proceeds as follows:

  1. [Definition: The atomized value of a grouping variable is called a grouping key.] For each pre-grouping tuple, the grouping keys are created by atomizing the values of the grouping variables. If the resulting value for any grouping variable consists of more than one item, a dynamic error is raised [err:XQDY0095].

  2. The input tuple stream is partitioned into groups of tuples whose grouping keys are equivalent. Two tuples T1 and T2 are in the same group if and only if, for each grouping variable GV, the atomized value of GV in T1 is equivalent to the atomized value of GV in T2. For this purpose, equivalence of two atomic values V1 and V2 is defined by the following rules:

    1. If V1 and V2 are both empty sequences, they are equivalent.

    2. If V1 and V2 are both NaN, they are equivalent.

    3. If the pertinent GroupingSpec specifies a collation C, and V1 and V2 are both convertible to the type xs:string by subtype substitution and/or type promotion, then:

      If fn:compare(V1, V2, C) returns zero, V1 and V2 are equivalent; otherwise they are not equivalent.

      If the collation C is specified by a relative URI, that relative URI is resolved to an absolute URI using the base URI in the static context. If the specified collation is not found in statically known collations, a static error is raised [err:XQST0076].

    4. If none of the above rules apply, then:

      If V1 eq V2 is true, V1 and V2 are equivalent; otherwise they are not equivalent.

      Note:

      If V1 and V2 are not comparable by the eq operator, no error is raised. In this case, V1 and V2 are not equivalent, and the tuples having these grouping keys are in separate groups.

Each group of tuples produced by the above process results in one post-grouping tuple. The pre-grouping tuples from which the group is derived have equivalent grouping keys, but these keys are not necessarily identical (for example, the strings "Frog" and "frog" might be equivalent according to the collation in use.) In the post-grouping tuple, each grouping variable is bound to the value of one of the original grouping variables. The choice of which grouping variable is chosen is implementation-dependent.

Editorial note  
Some members of the XQuery Working Group would prefer that the grouping variables in the post-grouping tuple contain the grouping key for a grouping variable in a pre-grouping tuple, which is atomized, rather than the value of the grouping variable in a pre-grouping tuple. We welcome feedback on this question.

In the post-grouping tuple generated for a given group, each non-grouping variable is bound to a sequence containing the concatenated values of that variable in all the pre-grouping tuples that were assigned to that group. If ordering mode is ordered, the values derived from individual tuples are concatenated in a way that preserves the order of the pre-grouping tuple stream; otherwise the ordering of these values is implementation-dependent.

Note:

In general, the static type of a variable in a post-grouping tuple is different from the static type of the variable with the same name in the pre-grouping tuples.

The order in which tuples appear in the post-grouping tuple stream is implementation-dependent.

Note:

An order by clause can be used to impose a value-based ordering on the post-grouping tuple stream. Similarly, if it is desired to impose a value-based ordering within a group (i.e., on the sequence of items bound to a non-grouping variable), this can be accomplished by a nested FLWOR expression that iterates over these items and applies an order by clause. In some cases, a value-based ordering within groups can be accomplished by applying an order by clause on a non-grouping variable before applying the group by clause.

A group by clause rebinds all the variables in the input tuple stream. The scopes of these variables are not affected by the group by clause, but in post-grouping tuples the values of the variables represent group properties rather than properties of individual pre-grouping tuples.

Examples:

  • This example illustrates the effect of a group by clause on a tuple stream.

    Input tuple stream:

    ($storeno = <storeno>S101</storeno>, $itemno = <itemno>P78395</itemno>)
    ($storeno = <storeno>S102</storeno>, $itemno = <itemno>P94738</itemno>)
    ($storeno = <storeno>S101</storeno>, $itemno = <itemno>P41653</itemno>)
    ($storeno = <storeno>S102</storeno>, $itemno = <itemno>P70421</itemno>)
    

    group by clause:

    group by $storeno
    

    Output tuple stream:

    ($storeno =  <storeno>S101</storeno>, $itemno = (<itemno>P78395</itemno>, <itemno>P41653<itemno>))
    ($storeno =  <storeno>S102</storeno>, $itemno = (<itemno>P94738</itemno>, <itemno>P70421</itemno>))
    
  • This example and the ones that follow are based on two separate sequences of elements, named $sales and $products. We assume that the variable $sales is bound to a sequence of elements with the following structure:

    <sales>
       <storeno>S101</storeno>
       <itemno>P78395</itemno>
       <qty>125</qty>
    </sales>
    

    We also assume that the variable $products is bound to a sequence of elements with the following structure:

    <product>
       <itemno>P78395</itemno>
       <price>25.00</price>
       <category>Men's Wear</category>
    </product>
    

    The simplest kind of grouping query has a single grouping variable. The query in this example finds the total quantity of items sold by each store:

    for $s in $sales
    let $storeno := $s/storeno
    group by $storeno
    return <store number="{$storeno}" total-qty="{sum($s/qty)}"/>
    

    The result of this query is a sequence of elements with the following structure:

    <store number="S101" total-qty="1550" />
    <store number="S102" total-qty="2125" />
    
  • In a more realistic example, a user might be interested in the total revenue generated by each store for each product category. Revenue depends on both the quantity sold of various items and the price of each item. The following query joins the two input sequences and groups the resulting tuples by two grouping variables:

    for $s in $sales,
        $p in $products[itemno = $s/itemno]
    let $storeno := $s/storeno,
        $category := $p/category,
        $revenue := $s/qty * $p/price
    group by $storeno, $category
    return
        <summary storeno="{$storeno}" 
                 category="{$category}" 
                 revenue="{sum($revenue)}"/>
    

    The result of this query is a sequence of elements with the following structure:

    <summary storeno="S101" category="Men's Wear" revenue="10185"/>
    <summary storeno="S101" category="Stationery" revenue="4520"/>
    <summary storeno="S102" category="Men's Wear" revenue="9750"/>
    <summary storeno="S102" category="Appliances" revenue="22650"/>
    <summary storeno="S102" category="Jewelry" revenue="30750"/>
    
  • The result of the previous example was a "flat" list of elements. A user might prefer the query result to be presented in the form of a hierarchical report, grouped primarily by store (in order by store number) and secondarily by product category. Within each store, the user might want to see only those product categories whose total revenue exceeds $10,000, presented in descending order by their total revenue. This report is generated by the following query:

    for $s1 in $sales
    let $storeno := $s1/storeno
    group by $storeno
    order by $storeno
    return
      <store storeno="{$storeno}">
        {for $s2 in $s1, 
             $p in $products[itemno = $s2/itemno]
         let $category := $p/category,
             $revenue := $s2/qty * $p/price
         group by $category
         let $group-revenue := sum($revenue)
         where $group-revenue > 10000
         order by $group-revenue descending
         return <category name="{$category}" revenue="{$group-revenue}"/>
        }
      </store>
    

    The result of this example query has the following structure:

    <store storeno="S101">
       <category name="Men's Wear" revenue="10185"/>
    </store>
    <store storeno="S102">
       <category name="Jewelry" revenue="30750"/>
       <category name="Appliances" revenue="22650"/>
    </store>
    
  • When writing a query that includes a group by clause, it is important to remember that, in each post-grouping tuple, each grouping variable is bound to a single atomic value (a grouping key), and all other variables are bound to sequences of items derived from all the pre-grouping tuples from which the group was formed. The following example illustrates how to avoid a possible pitfall in writing grouping queries.

    let $high-price := 1000
    for $p in $products[price > $high-price]
    let $category := $p/category
    group by $category
    return
       <category name="{$category}">
          {fn:count($p)} products have price greater than {$high-price}.
       </category>
    

    If three products in the "Men's Wear" category have prices greater than 1000, the result of this query might look (in part) like this:

    <category name="Men's Wear">
       3 products have price greater than 1000 1000 1000.
    </category>
    

    The repetition of "1000" in this query result is due to the fact that $high-price is not a grouping variable. One way to avoid this repetition is to move the binding of $high-price to an outer-level FLWOR expression, as follows:

    let $high-price := 1000
    return
       for $p in $products[price > $high-price]
       let $category := $p/category
       group by $category
       return
          <category name="{$category}">
             {fn:count($p)} products have price greater than {$high-price}.
          </category>
    

    The result of the revised query might contain the following element:

    <category name="Men's Wear">
       3 products have price greater than 1000.
    </category>
    

3.8.8 Order By Clause

[60]    OrderByClause    ::=    (("order" "by") | ("stable" "order" "by")) OrderSpecList
[61]    OrderSpecList    ::=    OrderSpec ("," OrderSpec)*
[62]    OrderSpec    ::=    ExprSingle OrderModifier
[63]    OrderModifier    ::=    ("ascending" | "descending")? ("empty" ("greatest" | "least"))? ("collation" URILiteral)?

The purpose of an order by clause is to impose a value-based ordering on the tuples in the tuple stream. The output tuple stream of the order by clause contains the same tuples as its input tuple stream, but the tuples may be in a different order.

An order by clause contains one or more ordering specifications, called orderspecs, as shown in the grammar. For each tuple in the input tuple stream, the orderspecs are evaluated, using the variable bindings in that tuple. The relative order of two tuples is determined by comparing the values of their orderspecs, working from left to right until a pair of unequal values is encountered. If an orderspec specifies a collation, that collation is used in comparing values of type xs:string, xs:anyURI, or types derived from them (otherwise, the default collation is used in comparing values of these types). If an orderspec specifies a collation by a relative URI, that relative URI is resolved to an absolute URI using the base URI in the static context. If an orderspec specifies a collation that is not found in statically known collations, an error is raised [err:XQST0076].

The process of evaluating and comparing the orderspecs is based on the following rules:

  • Atomization is applied to the result of the expression in each orderspec. If the result of atomization is neither a single atomic value nor an empty sequence, a type error is raised [err:XPTY0004].

  • If the value of an orderspec has the dynamic type xs:untypedAtomic (such as character data in a schemaless document), it is cast to the type xs:string.

    Note:

    Consistently treating untyped values as strings enables the sorting process to begin without complete knowledge of the types of all the values to be sorted.

  • All the non-empty orderspec values must be convertible to a common type by subtype substitution and/or type promotion. The ordering is performed in the least common type that has a gt operator. If two or more non-empty orderspec values are not convertible to a common type that has a gt operator, a type error is raised [err:XPTY0004].

    • Example: The orderspec values include a value of type hatsize, which is derived from xs:integer, and a value of type shoesize, which is derived from xs:decimal. The least common type reachable by subtype substitution and type promotion is xs:decimal.

    • Example: The orderspec values include a value of type xs:string and a value of type xs:anyURI. The least common type reachable by subtype substitution and type promotion is xs:string.

For the purpose of determining their relative position in the ordering sequence, the greater-than relationship between two orderspec values W and V is defined as follows:

  • When the orderspec specifies empty least, the following rules are applied in order:

    1. If V is an empty sequence and W is not an empty sequence, then W greater-than V is true.

    2. If V is NaN and W is neither NaN nor an empty sequence, then W greater-than V is true.

    3. If a specific collation C is specified, and V and W are both of type xs:string or are convertible to xs:string by subtype substitution and/or type promotion, then:

      If fn:compare(V, W, C) is less than zero, then W greater-than V is true; otherwise W greater-than V is false.

    4. If none of the above rules apply, then:

      If W gt V is true, then W greater-than V is true; otherwise W greater-than V is false.

  • When the orderspec specifies empty greatest, the following rules are applied in order:

    1. If W is an empty sequence and V is not an empty sequence, then W greater-than V is true.

    2. If W is NaN and V is neither NaN nor an empty sequence, then W greater-than V is true.

    3. If a specific collation C is specified, and V and W are both of type xs:string or are convertible to xs:string by subtype substitution and/or type promotion, then:

      If fn:compare(V, W, C) is less than zero, then W greater-than V is true; otherwise W greater-than V is false.

    4. If none of the above rules apply, then:

      If W gt V is true, then W greater-than V is true; otherwise W greater-than V is false.

  • When the orderspec specifies neither empty least nor empty greatest, the default order for empty sequences in the static context determines whether the rules for empty least or empty greatest are used.

If T1 and T2 are two tuples in the input tuple stream, and V1 and V2 are the first pair of values encountered when evaluating their orderspecs from left to right for which one value is greater-than the other (as defined above), then:

  1. If V1 is greater-than V2: If the orderspec specifies descending, then T1 precedes T2 in the output tuple stream; otherwise, T2 precedes T1 in the output tuple stream.

  2. If V2 is greater-than V1: If the orderspec specifies descending, then T2 precedes T1 in the output tuple stream; otherwise, T1 precedes T2 in the output tuple stream.

If neither V1 nor V2 is greater-than the other for any pair of orderspecs for tuples T1 and T2, the following rules apply.

  1. If stable is specified, the original order of T1 and T2 is preserved in the output tuple stream.

  2. If stable is not specified, the order of T1 and T2 in the output tuple stream is implementation-dependent.

Note:

If two orderspecs return the special floating-point values positive and negative zero, neither of these values is greater-than the other, since +0.0 gt -0.0 and -0.0 gt +0.0 are both false.

Examples:

  • This example illustrates the effect of an order by clause on a tuple stream. The keyword stable indicates that, when two tuples have equal sort keys, their order in the input tuple stream is preserved.

    Input tuple stream:

    ($license = "PFQ519", $make = "Ford",  $value = 16500)
    ($license = "HAJ865", $make = "Honda", $value = 22750)
    ($license = "NKV473", $make = "Ford",  $value = 21650)
    ($license = "RCM922", $make = "Dodge", $value = 11400)
    ($license = "ZBX240", $make = "Ford",  $value = 16500)
    ($license = "KLM030", $make = "Dodge", $value = () )
    

    order by clause:

    stable order by $make,
       $value descending empty least
    

    Output tuple stream:

    ($license = "RCM922", $make = "Dodge", $value = 11400)
    ($license = "KLM030", $make = "Dodge", $value = () )
    ($license = "NKV473", $make = "Ford",  $value = 21650)
    ($license = "PFQ519", $make = "Ford",  $value = 16500)
    ($license = "ZBX240", $make = "Ford",  $value = 16500)
    ($license = "HAJ865", $make = "Honda", $value = 22750)
    
  • The following example shows how an order by clause can be used to sort the result of a query, even if the sort key is not included in the query result. This query returns employee names in descending order by salary, without returning the actual salaries:

    for $e in $employees 
    order by $e/salary descending 
    return $e/name
    

Note:

Since the order by clause in a FLWOR expression is the only facility provided by XQuery for specifying a value ordering, a FLWOR expression must be used in some queries where iteration would not otherwise be necessary. For example, a list of books with price less than 100 might be obtained by a simple path expression such as $books/book[price < 100]. But if these books are to be returned in alphabetic order by title, the query must be expressed as follows:

for $b in $books/book[price < 100]
order by $b/title
return $b

3.8.9 Return Clause

[64]    ReturnClause    ::=    "return" ExprSingle

The return clause is the final clause of a FLWOR expression. The return clause is evaluated once for each tuple in its input tuple stream, using the variable bindings in the respective tuples, in the order in which these tuples appear in the input tuple stream. The results of these evaluations are concatenated, as if by the comma operator, to form the result of the FLWOR expression.

The following example illustrates a FLWOR expression containing several clauses. The for clause iterates over all the departments in an input document named depts.xml, binding the variable $d to each department in turn. For each binding of $d, the let clause binds variable $e to all the employees in the given department, selected from another input document named emps.xml (the relationship between employees and departments is represented by matching their deptno values). Each tuple in the resulting tuple stream contains a pair of bindings for $d and $e ($d is bound to a department and $e is bound to a set of employees in that department). The where clause filters the tuple stream, retaining only those tuples that represent departments having at least ten employees. The order by clause orders the surviving tuples in descending order by the average salary of the employees in the department. The return clause constructs a new big-dept element for each surviving tuple, containing the department number, headcount, and average salary.

for $d in fn:doc("depts.xml")//dept
let $e := fn:doc("emps.xml")//emp[deptno eq $d/deptno]
where fn:count($e) >= 10
order by fn:avg($e/salary) descending
return
   <big-dept>
      {
      $d/deptno,
      <headcount>{fn:count($e)}</headcount>,
      <avgsal>{fn:avg($e/salary)}</avgsal>
      }
   </big-dept>

Notes:

  • The order in which items appear in the result of a FLWOR expression depends on the ordering of the input tuple stream to the return clause, which in turn is influenced by order by clauses and by ordering mode. For example, consider the following query, which is based on the same two input documents as the previous example:

    for $d in fn:doc("depts.xml")//dept
    order by $d/deptno
    for $e in fn:doc("emps.xml")//emp[deptno eq $d/deptno]
    return
       <assignment>
          {$d/deptno, $e/name}
       </assignment
    

    The result of this query is a sequence of assignment elements, each containing a deptno element and a name element. The sequence will be ordered primarily by the deptno values because of the order by clause. If ordering mode is ordered, subsequences of assignment elements with equal deptno values will be ordered by the document order of their name elements within the emps.xml document; otherwise the ordering of these subsequences will be implementation-dependent.

  • Parentheses are helpful in return clauses that contain comma operators, since FLWOR expressions have a higher precedence than the comma operator. For example, the following query raises an error because after the comma, $j is no longer within the FLWOR expression, and is an undefined variable:

    let $i := 5,
        $j := 20 * $i
    return $i, $j
    

    Parentheses can be used to bring $j into the return clause of the FLWOR expression, as the programmer probably intended:

    let $i := 5,
        $j := 20 * $i
    return ($i, $j)
    

3.9 Ordered and Unordered Expressions

[114]    OrderedExpr    ::=    "ordered" "{" Expr "}"
[115]    UnorderedExpr    ::=    "unordered" "{" Expr "}"

The purpose of ordered and unordered expressions is to set the ordering mode in the static context to ordered or unordered for a certain region in a query. The specified ordering mode applies to the expression nested inside the curly braces. For expressions where the ordering of the result is not significant, a performance advantage may be realized by setting the ordering mode to unordered, thereby granting the system flexibility to return the result in the order that it finds most efficient.

Ordering mode affects the behavior of path expressions that include a "/" or "//" operator or an axis step; union, intersect, and except expressions; the fn:id and fn:idref functions; and certain clauses within a FLWOR expression. If ordering mode is ordered, node sequences returned by path expressions, union, intersect, and except expressions, and the fn:id and fn:idref functions are in document order; otherwise the order of these return sequences is implementation-dependent. The effect of ordering mode on FLWOR expressions is described in 3.8.2 For Clause, 3.8.4.3 Effects of Window Clauses on the Tuple Stream, and 3.8.7 Group By Clause. Ordering mode has no effect on duplicate elimination.

Note:

In a region of a query where ordering mode is unordered, the result of an expression may be nondeterministic if the expression invokes certain functions that are affected by the ordering of node sequences. These functions include fn:position, fn:last, fn:index-of, fn:insert-before, fn:remove, fn:reverse, and fn:subsequence. Also, within a path expression in an unordered region, numeric predicates are nondeterministic. For example, in an ordered region, the path expression (//a/b)[5] will return the fifth qualifying b-element in document order. In an unordered region, the same expression will return an implementation-dependent qualifying b-element.

Note:

The fn:id and fn:idref functions are described in [XQuery 1.0 and XPath 2.0 Functions and Operators] as returning their results in document order. Since ordering mode is a feature of XQuery, relaxation of the ordering requirement for function results when ordering mode is unordered is a feature of XQuery rather than of the functions themselves.

The use of an unordered expression is illustrated by the following example, which joins together two documents named parts.xml and suppliers.xml. The example returns the part numbers of red parts, paired with the supplier numbers of suppliers who supply these parts. If an unordered expression were not used, the resulting list of (part number, supplier number) pairs would be required to have an ordering that is controlled primarily by the document order of parts.xml and secondarily by the document order of suppliers.xml. However, this might not be the most efficient way to process the query if the ordering of the result is not important. An XQuery implementation might be able to process the query more efficiently by using an index to find the red parts, or by using suppliers.xml rather than parts.xml to control the primary ordering of the result. The unordered expression gives the query evaluator freedom to make these kinds of optimizations.

unordered {
  for $p in fn:doc("parts.xml")/parts/part[color = "Red"],
      $s in fn:doc("suppliers.xml")/suppliers/supplier
  where $p/suppno = $s/suppno  
  return
    <ps>
       { $p/partno, $s/suppno }
    </ps>
}

In addition to ordered and unordered expressions, XQuery provides a function named fn:unordered that operates on any sequence of items and returns the same sequence in a nondeterministic order. A call to the fn:unordered function may be thought of as giving permission for the argument expression to be materialized in whatever order the system finds most efficient. The fn:unordered function relaxes ordering only for the sequence that is its immediate operand, whereas an unordered expression sets the ordering mode for its operand expression and all nested expressions.

3.10 Conditional Expressions

XQuery 1.1 supports a conditional expression based on the keywords if, then, and else.

[68]    IfExpr    ::=    "if" "(" Expr ")" "then" ExprSingle "else" ExprSingle

The expression following the if keyword is called the test expression, and the expressions following the then and else keywords are called the then-expression and else-expression, respectively.

The first step in processing a conditional expression is to find the effective boolean value of the test expression, as defined in 2.4.3 Effective Boolean Value.

The value of a conditional expression is defined as follows: If the effective boolean value of the test expression is true, the value of the then-expression is returned. If the effective boolean value of the test expression is false, the value of the else-expression is returned.

Conditional expressions have a special rule for propagating dynamic errors. If the effective value of the test expression is true, the conditional expression ignores (does not raise) any dynamic errors encountered in the else-expression. In this case, since the else-expression can have no observable effect, it need not be evaluated. Similarly, if the effective value of the test expression is false, the conditional expression ignores any dynamic errors encountered in the then-expression, and the then-expression need not be evaluated.

Here are some examples of conditional expressions:

  • In this example, the test expression is a comparison expression:

    if ($widget1/unit-cost < $widget2/unit-cost) 
      then $widget1
      else $widget2
    
  • In this example, the test expression tests for the existence of an attribute named discounted, independently of its value:

    if ($part/@discounted) 
      then $part/wholesale 
      else $part/retail
    

3.11 Quantified Expressions

Quantified expressions support existential and universal quantification. The value of a quantified expression is always true or false.

[65]    QuantifiedExpr    ::=    ("some" | "every") "$" VarName TypeDeclaration? "in" ExprSingle ("," "$" VarName TypeDeclaration? "in" ExprSingle)* "satisfies" ExprSingle
[144]    TypeDeclaration    ::=    "as" SequenceType

A quantified expression begins with a quantifier, which is the keyword some or every, followed by one or more in-clauses that are used to bind variables, followed by the keyword satisfies and a test expression. Each in-clause associates a variable with an expression that returns a sequence of items, called the binding sequence for that variable. The in-clauses generate tuples of variable bindings, including a tuple for each combination of items in the binding sequences of the respective variables. Conceptually, the test expression is evaluated for each tuple of variable bindings. Results depend on the effective boolean value of the test expressions, as defined in 2.4.3 Effective Boolean Value. The value of the quantified expression is defined by the following rules:

  1. If the quantifier is some, the quantified expression is true if at least one evaluation of the test expression has the effective boolean value true; otherwise the quantified expression is false. This rule implies that, if the in-clauses generate zero binding tuples, the value of the quantified expression is false.

  2. If the quantifier is every, the quantified expression is true if every evaluation of the test expression has the effective boolean value true; otherwise the quantified expression is false. This rule implies that, if the in-clauses generate zero binding tuples, the value of the quantified expression is true.

The scope of a variable bound in a quantified expression comprises all subexpressions of the quantified expression that appear after the variable binding. The scope does not include the expression to which the variable is bound.

Each variable bound in an in-clause of a quantified expression may have an optional type declaration. If the type of a value bound to the variable does not match the declared type according to the rules for SequenceType matching, a type error is raised [err:XPTY0004].

The order in which test expressions are evaluated for the various binding tuples is implementation-dependent. If the quantifier is some, an implementation may return true as soon as it finds one binding tuple for which the test expression has an effective boolean value of true, and it may raise a dynamic error as soon as it finds one binding tuple for which the test expression raises an error. Similarly, if the quantifier is every, an implementation may return false as soon as it finds one binding tuple for which the test expression has an effective boolean value of false, and it may raise a dynamic error as soon as it finds one binding tuple for which the test expression raises an error. As a result of these rules, the value of a quantified expression is not deterministic in the presence of errors, as illustrated in the examples below.

Here are some examples of quantified expressions:

  • This expression is true if every part element has a discounted attribute (regardless of the values of these attributes):

    every $part in /parts/part satisfies $part/@discounted
    
  • This expression is true if at least one employee element satisfies the given comparison expression:

    some $emp in /emps/employee satisfies 
         ($emp/bonus > 0.25 * $emp/salary)
    
  • In the following examples, each quantified expression evaluates its test expression over nine tuples of variable bindings, formed from the Cartesian product of the sequences (1, 2, 3) and (2, 3, 4). The expression beginning with some evaluates to true, and the expression beginning with every evaluates to false.

    some $x in (1, 2, 3), $y in (2, 3, 4) 
         satisfies $x + $y = 4
    
    every $x in (1, 2, 3), $y in (2, 3, 4) 
         satisfies $x + $y = 4
    
  • This quantified expression may either return true or raise a type error, since its test expression returns true for one variable binding and raises a type error for another:

    some $x in (1, 2, "cat") satisfies $x * 2 = 4
    
  • This quantified expression may either return false or raise a type error, since its test expression returns false for one variable binding and raises a type error for another:

    every $x in (1, 2, "cat") satisfies $x * 2 = 4
    
  • This quantified expression contains a type declaration that is not satisfied by every item in the test expression. If the Static Typing Feature is implemented, this expression raises a type error during the st