Re: TREE in a database

Actually relational databases are set-based. The answer to your tree structures question is that it is possible. It is quite complicated though, so have a look at this phphoo tutorial: http://www.webreference.com/perl/xhoo/php1/ Rick Emery <remery@excel.com> wrote in message news:EAA093B474ABD311A71E00508B5FE08305C2CB59@adntex03.us.excel.com... > Relational databases really are tree structures. However, whereas a tree > parent node has pointers to children or sibling nodes; in a relational > database, the nodes "point up" to the parent node. The nodes might also > maintain a field to identify sibling nodes. > > -----Original Message----- > From: Robert Vukovic [mailto:vrobert@EUnet.yu] > Sent: Monday, October 29, 2001 2:03 PM > To: 'Php-DB' > Subject: [PHP-DB] TREE in a database > > > Is there an easy way to implement tree structure in a database. > Something like file systems do for files. > > Hints, links, anything. > > > -- > PHP Database Mailing List (http://www.php.net/) > To unsubscribe, e-mail: php-db-unsubscribe@lists.php.net > For additional commands, e-mail: php-db-help@lists.php.net > To contact the list administrators, e-mail: php-list-admin@lists.php.net > >