XPath 2.0

Channel:

all the knowledge of the universe PRINCIPIA

Subscribers:

1,860

Published on January 8, 2022 7:01:08 PM ● Video Link: https://www.youtube.com/watch?v=ekIQQfK9QSw

Duration: 6:28

89 views

0

XPath 2.0, by Wikipedia https://en.wikipedia.org/wiki?curid=1003003 / CC BY SA 3.0

#XML_data_access
XPath 2.
0 is a version of the XPath language defined by the World Wide Web Consortium, W3C. It became a recommendation on 23 January 2007.
As a W3C Recommendation it was superseded by XPath 3.
0 on 10 April 2014.
XPath is used primarily for selecting parts of an XML document.
For this purpose the XML document is modelled as a tree of nodes.
XPath allows nodes to be selected by means of a hierarchic navigation path through the document tree.
The language is significantly larger than its predecessor, XPath 1.
0, and some of the basic concepts such as the data model and type system have changed.
The two language versions are therefore described in separate articles.
XPath 2.
0 is used as a sublanguage of XSLT 2.
0, and it is also a subset of XQuery 1.
0.
All three languages share the same data model （the XDM）, type system, and function library, and were developed together and published on the same day.
Every value in XPath 2.
0 is a sequence of items.
The items may be nodes or atomic values.
An individual node or atomic value is considered to be a sequence of length one.
Sequences may not be nested.
Nodes are of seven kinds, corresponding to different constructs in the syntax of XML: elements, attributes, text nodes, comments, processing instructions, namespace nodes, and document nodes.
（The document node replaces the root node of XPath 1.0, because the XPath 2.0 model allows trees to be rooted at other kinds of node, notably elements.） Nodes may be typed or untyped.
A node acquires a type as a result of validation against an XML Schema.
If an element or attribute is successfully validated against a particular complex type or simple type defined in a schema, the name of that type is attached as an annotation to the node,
and determines the outcome of operations applied to that node: for example, when sorting, nodes that are annotated as integers will be sorted as inte...