dawn wrote:
> Jan Hidders wrote:
>
>>I think the answer is, vaguely, yes. :-) You can think of the tree is a
>>binary relation, and if you want access to all descendants the system
>>could provide conceptually the transitive closure to you (so for the
>>binary table R you could for example use R* as the notation for its
>>transitive closure) and from there you could specify your queries as
>>usual. Most XPath queries would then translatie to simple
>>SELECT-FROM-WHERE queres.
>
> If they are not nested relations but nested ordered lists, as possible
> with XML documents, then you would lose information this way, right?
Right. But you could add an extra binary relation that defines the order.
Received on Tue Feb 07 2006 - 16:51:02 CST
