- From: Jan Hidders <jan.hidders@ua.ac.be>
- Date: Tue, 23 Sep 2003 19:08:34 +0200
- To: www-ql@w3.org
Hello Michael,
Michael Brundage wrote:
>
> Completely separately from this, every node in the data model is ordered
> relative to every other one. Your query happens to be creating a sequence
> of c elements, each in its own fragment. Consider the two queries below:
>
> let $tree1 := (<x><y/><y/></x>)/y
> return $tree1[1] << $tree1[2]
>
> always returns true. The two y child elements of x are siblings of one
> another, and the first one always comes before the second in document order.
That's actually true regardless of whether the children of the x element
are in document order or not because the let clause uses a path
expression which returns always a result in document order.
--
Jan Hidders
.---------------------------------------------------------------------.
| Post-doctoral researcher e-mail: jan.hidders@ua.ac.be |
| Dept. Math. & Computer Science tel: (+32) 3 218 08 73 |
| University of Antwerp fax: (+32) 3 218 07 77 |
| Middelheimlaan 1, BE-2020 Antwerpen, BELGIUM room: G 3.21 |
`---------------------------------------------------------------------'
Received on Tuesday, 23 September 2003 13:08:55 UTC