|
|
|
| Come for the quick hacks, stay for the epiphanies. | |
| PerlMonks |
Re: Graphical Hierarchical Treeby voyager (Friar) |
| on Mar 05, 2001 at 01:58 UTC ( [id://62169]=note: print w/replies, xml ) | Need Help?? |
This is an archived low-energy page for bots and other anonmyous visitors. Please sign up if you are a human and want to interact.
Since you asked for any other comments: if you set up the database so that every row has the key of the root ($article in your case, I think), then you can grab all of the replies with one sql statement.
Do the sorting out of the hierarchy on the returned results set. Your response time on an application like this is almost always > 90% a function of your sql. The time taken in the procedural (Perl) code is noise. You stand to gain substantially.
In Section
Seekers of Perl Wisdom
|
|
||||||||||||||||||||||||