I'd recommend you search the PHP archives for an answer. This question comes
up a few times a year and the last time I remember seeing it, somebody (John
Holmes, I think) provided an excellent discourse on the different ways to
approach this solution.
You'll probably get other new responses with
From: Age Bosma [EMAIL PROTECTED]
I'm trying to work out what the most efficient way will be to get the
complete tree structure from top to bottom of a category tree db.
Search the archives or Google for nested sets. That's going to be the most
efficient database scheme to use. Any
]
Sent: Friday, March 19, 2004 11:42 AM
To: [EMAIL PROTECTED]; Age Bosma
Subject: Re: [PHP-DB] MySQL category tree db sorting
From: Age Bosma [EMAIL PROTECTED]
I'm trying to work out what the most efficient way will be to get the
complete tree structure from top to bottom of a category tree db
