Ok so I have read the chapter I think the best option is postgres recursive queries.
On Tue, Apr 10, 2012 at 10:39 AM, Richard Vézina < ml.richard.vez...@gmail.com> wrote: > Yes AntiPattern cover 4 or 5 kind of tree representation, classify them > depending of usage and gives pros and cons. > > I choose Closure table since it was one of the more complet for my case. > But if parent node is changing frequently it's not the more effecient tree > antipattern. > > Have look it is pretty instructive. > > Book contain little more explanation, but there is this slide : > > > http://www.slideshare.net/billkarwin/practical-object-oriented-models-in-sql > > Richard > > > On Tue, Apr 10, 2012 at 7:32 AM, stefaan <stefaan.hi...@gmail.com> wrote: > >> >> >> >> Well I know the major bottle neck in the site is the binary tree. I am >>> still trying to figure out how to do this the best and most efficient. >>> >> >> Maybe this could be useful: >> http://dirtsimple.org/2010/11/simplest-way-to-do-tree-based-queries.html >> >> > > -- -- Regards, Bruce Wade http://ca.linkedin.com/in/brucelwade http://www.wadecybertech.com http://www.fittraineronline.com - Fitness Personal Trainers Online http://www.warplydesigned.com
