Re: A new approach to storing ordered hierarchical data in RDBs.
From: paul c <toledobythesea_at_oohay.ac>
Date: Wed, 22 Nov 2006 00:35:02 GMT
Message-ID: <WWM8h.342823$1T2.272415_at_pd7urf2no>
>
>
> I especially liked the phrase "Don't worry about the loop" :-)
>
> /Lennart
>
Date: Wed, 22 Nov 2006 00:35:02 GMT
Message-ID: <WWM8h.342823$1T2.272415_at_pd7urf2no>
Lennart wrote:
> Aloha Kakuikanu wrote:
> [...]
>
>>Please make sure you use terms correctly. What you have meant by >>"lineage" is "transitive closure". This article >>http://www.sqlteam.com/item.asp?ItemID=8866 >>uses the term "lineage" in the sense of "materialized path".
>
>
> I especially liked the phrase "Don't worry about the loop" :-)
>
> /Lennart
>
I especially laughed at the phrase "XML handles hierarchical ... quite well". How the dickens does XML per se calculate transitive closure or depth from an adjency list or an adjaceny list from a tree? It seems to me that XML by itself only allows adhoc solutions that are just as non-declarative as various SQL versions. For that matter, the original relational model seems to requires similar adhoc additions. I don't have a solution, but it seems to me that all three are lacking and it is irresponsible, ignorant and cavalier to use the adverb "well" regarding accomplishing closure with any of them.
p Received on Wed Nov 22 2006 - 01:35:02 CET