On Wed, 02 Apr 2003 16:53:44 +0200, Grégoire Dubois
<[EMAIL PROTECTED]> wrote:
>Creating the tree doesn't give me problem. Where I ask me some
>questions, is the speed to get the whole tree from the database in a
>recursive way.
I've made a PHP script doing genealogical descendancy charts that
;.
>
>
>Good luck with it.
>Kevin
>
>-Original Message-
>From: Grégoire Dubois [mailto:[EMAIL PROTECTED]
>Sent: Wednesday, April 02, 2003 6:54 AM
>To: [EMAIL PROTECTED]
>Subject: Conception - Tree - Recursivity -Address book - Query speed
>
an follow up his article by looking in Usenet groups
for the term "Nested Set Hierarchy" or "Nested Set Model".
Good luck with it.
Kevin
-Original Message-
From: Grégoire Dubois [mailto:[EMAIL PROTECTED]
Sent: Wednesday, April 02, 2003 6:54 AM
To: [EMAIL PROTECTED]
Subject
, 2003 6:54 AM
To: [EMAIL PROTECTED]
Subject: Conception - Tree - Recursivity -Address book - Query speed
Hello all,
I am putting multiple "address book" (trees) into a MySQL database.
These "address book" are made of "directories" and "persons".
Hello all,
I am putting multiple "address book" (trees) into a MySQL database.
These "address book" are made of "directories" and "persons".
It gives something like that for the tables :
Directory
--
ID
Name
ID_father (the reference to the father directory)
Pers
