Relational database theory derives from set theory. (EF Codd circa 1980)
A tree structure may be viewed as a set of branches each containing a set
branches and leaves.
The root is simply a branch with no parent branch.
A leaf is simply a branch with no child branch.
Thus, we are mapping one set-of-sets onto another set-of-sets.
-----Original Message-----
From: Henning von Bargen [mailto:[EMAIL PROTECTED]]
Sent: 19 October 2001 08:49
To: '[EMAIL PROTECTED]'
Subject: AW: [vote] A native XML database project under Apache
> -----Urspr�ngliche Nachricht-----
> Von: Robert Stuart [SMTP:[EMAIL PROTECTED]]
> Gesendet am: Freitag, 19. Oktober 2001 09:45
> An: '[EMAIL PROTECTED]'
> Betreff: RE: [vote] A native XML database project under Apache
>
> Any XML document, by definition, must be represented by a tree structure.
> This means that, for all valid XML documents have a clearly defined
> structure.
>
> Tree structures map, very naturally, into relational databases (pun not
> intended).
> For the rest of this note, any reference I make to a database (db), assume
I
> mean a relational database.
Sorry, I can't follow you.
Your are right that XML is a tree structure.
But how can a tree structure map naturally into relational databases?
>
> XML documents may (optional) have meta-data associated with them (DTD, or
...
>
> Robert Stuart
>
Henning
---------------------------------------------------------------------
In case of troubles, e-mail: [EMAIL PROTECTED]
To unsubscribe, e-mail: [EMAIL PROTECTED]
For additional commands, e-mail: [EMAIL PROTECTED]
---------------------------------------------------------------------
In case of troubles, e-mail: [EMAIL PROTECTED]
To unsubscribe, e-mail: [EMAIL PROTECTED]
For additional commands, e-mail: [EMAIL PROTECTED]
