Re: Does Codd's view of a relational database differ from that ofDate&Darwin?[M.Gittens]
From: VC <boston103_at_hotmail.com>
Date: Sun, 3 Jul 2005 00:37:22 -0400
Message-ID: <3PqdnQMmFrPm9lrfRVn-1Q_at_comcast.com>
Date: Sun, 3 Jul 2005 00:37:22 -0400
Message-ID: <3PqdnQMmFrPm9lrfRVn-1Q_at_comcast.com>
"Jan Hidders" <jan.hidders_at_REMOVETHIS.pandora.be> wrote in message
news:CwAxe.135730$_81.6969472_at_phobos.telenet-ops.be...
> VC wrote:
>> How is it different ? Is it not just a notation for trees (with a lot of
>> other baggage admittedly) ?
>
> Yes, ordered, node-labeled trees, whereas the other two are more about
> graphs.
Sorry to state the trivial but a tree *is* a graph (a rooted tree is a DAG). So why cannot we treat the whole bunch FDM/OODB/XML in the same way ?
>
> -- Jan Hidders
Received on Sun Jul 03 2005 - 06:37:22 CEST