You are here: Re: The best way to traverse a tree « All PHP « IT news, forums, messages
Re: The best way to traverse a tree

Posted by Stefan Rybacki on 10/20/05 16:27

>...
> That's a possibility.

Then go ahead with it.

>
>
>>The problem if such a structure is the overhead on inserting new data.
>>And since he has a comment system, insertion could be very often. Don't
>>get me wrong I would prefer such a structure but I'm not sure whether
>>the OP get it to work or whether the insertion takes to long.
>
>
> There would be far more retrievals than inserts, so I think this could be
> the way to do it. Now to come up with some sort of cunning scheme...

Have a look at the nested set model.

>
> Of course, a good way to do it would have been with stored procedures to
> do all the leg work for the retreivals, using a simpler structure for
> faster inserts, but that's not possible with the antique version of MySQL
> I'm running.

yes, thats too bad, but the nested set model can handle it for you too.

>
> Anyway, thanks to all for the advice.
>
> Naich.

Regards
Stefan

 

Navigation:

[Reply to this message]


Удаленная работа для программистов  •  Как заработать на Google AdSense  •  England, UK  •  статьи на английском  •  PHP MySQL CMS Apache Oscommerce  •  Online Business Knowledge Base  •  DVD MP3 AVI MP4 players codecs conversion help
Home  •  Search  •  Site Map  •  Set as Homepage  •  Add to Favourites

Copyright © 2005-2006 Powered by Custom PHP Programming

Сайт изготовлен в Студии Валентина Петручека
изготовление и поддержка веб-сайтов, разработка программного обеспечения, поисковая оптимизация