Thanks, that is exactly what I needed and it doesn't look so
complicated.
-Original Message-
From: John Lim [mailto:[EMAIL PROTECTED]]
Sent: 31. oktobar 2001. 16:44
To: [EMAIL PROTECTED]
Subject: Re: [PHP-DB] TREE in a database
Actually relational databases are set-based
what I needed and it doesn't
look so
complicated.
-Original Message-
From: John Lim [mailto:[EMAIL PROTECTED]]
Sent: 31. oktobar 2001. 16:44
To: [EMAIL PROTECTED]
Subject: Re: [PHP-DB] TREE in a database
Actually relational databases are set-based. The
answer
ng nodes.
-Original Message-
From: Robert Vukovic [mailto:[EMAIL PROTECTED]]
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,
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: [EMAIL PROTECTED]
For additional commands, e-mail: [EMAIL PROTECTED]
To contact the list
The OASIS project for ad-server uses hierchical system for the sections
stored in Mysql.
the simplest structure is a row with 3 fields(node_id - autoincrement,
parent_id int, data - sometype). the root has parent_id NULL or 0(because
autoincrements usually starts from 1, but this is subject
