Roughly, this means that content fragments can have more than one top-level element or character node. The expression xmlvalue IS DOCUMENT can be used to evaluate whether a particular xml value is a text|no value [, standalone yes|no|no value]) The xmlroot expression alters the properties of the root node of an XML value. If a version is specified, this replaces the value in the version declaration, if expression xpath against the XML value xml. It returns an array of XML values corresponding to the node set produced by the XPath expression. The third argument of the function is an array of namespace

Roughly, this means that content fragments can have more than one top-level element or character node. The expression xmlvalue IS DOCUMENT can be used to evaluate whether a particular xml value is a full text|no value [, standalone yes|no|no value]) The xmlroot expression alters the properties of the root node of an XML value. If a version is specified, this replaces the value in the version declaration, if expression xpath against the XML value xml. It returns an array of XML values corresponding to the node set produced by the XPath expression. The third argument of the function is an array of namespace

Roughly, this means that content fragments can have more than one top-level element or character node. The expression xmlvalue IS DOCUMENT can be used to evaluate whether a particular xml value is a full root node of an XML value. If a version is spec- ified, it replaces the value in the root node’s version declaration; if a standalone setting is specified, it replaces the value in the root node’s standalone to the node set produced by the XPath expression. 212 Chapter 9. Functions and Operators The second argument must be a well formed XML document. In particular, it must have a single root node element

Roughly, this means that content fragments can have more than one top-level element or character node. The expression xmlvalue IS DOCUMENT can be used to evaluate whether a particular xml value is a the root node of an XML value. If a version is specified, it replaces the value in the root node’s version declaration; if a standalone setting is specified, it replaces the value in the root node’s standalone values corresponding to the node set produced by the XPath expression. The second argument must be a well formed XML document. In particular, it must have a single root node element. The third argument

.....................................................................2096 60.4.2. SP-GiST Without Node Labels..............................................................2096 60.4.3. “All-the-same” Inner the more permissive “document node”1 of the XQuery and XPath data model. Roughly, this means that content fragments can have more than one top-level element or character node. The expression xmlvalue IS root node of an XML value. If a version is spec- ified, it replaces the value in the root node’s version declaration; if a standalone setting is specified, it replaces the value in the root node’s standalone

.....................................................................2223 60.4.2. SP-GiST Without Node Labels.....................................................................2224 60.4.3. “All-the-same” the more permissive “document node”1 of the XQuery and XPath data model. Roughly, this means that content fragments can have more than one top-level element or character node. The expression xmlvalue IS the root node of an XML value. If a version is specified, it replaces the value in the root node’s version declaration; if a standalone setting is specified, it replaces the value in the root node’s standalone

.....................................................................2100 57.4.2. SP-GiST Without Node Labels.....................................................................2101 57.4.3. “All-the-same” the more permissive “document node”1 of the XQuery and XPath data model. Roughly, this means that content fragments can have more than one top-level element or character node. The expression xmlvalue IS the root node of an XML value. If a version is specified, it replaces the value in the root node’s version declaration; if a standalone setting is specified, it replaces the value in the root node’s standalone

.....................................................................1977 57.4.2. SP-GiST Without Node Labels..............................................................1977 57.4.3. “All-the-same” Inner the more permissive “document node”1 of the XQuery and XPath data model. Roughly, this means that content fragments can have more than one top-level element or character node. The expression xmlvalue IS root node of an XML value. If a version is spec- ified, it replaces the value in the root node’s version declaration; if a standalone setting is specified, it replaces the value in the root node’s standalone

possibilities. The total cost is computed from the per-row costs of each plan node times the selectivity estimate of the plan node. The costs estimated for the plan nodes can be adjusted via run-time parameters way to do these operations, so different node types can appear here too. The output of EXPLAIN has one line for each node in the plan tree, showing the basic node type plus the cost estimates that the planner planner made for the execution of that plan node. The first line (topmost node) has the estimated total execution cost for the plan; it is this number that the planner seeks to minimize. Here is a trivial

possibilities. The total cost is computed from the per-row costs of each plan node times the selectivity estimate of the plan node. The costs estimated for the plan nodes can be adjusted via run-time parameters way to do these operations, so different node types can appear here too. The output of EXPLAIN has one line for each node in the plan tree, showing the basic node type plus the cost estimates that the planner planner made for the execution of that plan node. The first line (topmost node) has the estimated total execution cost for the plan; it is this number that the planner seeks to minimize. Here is a trivial