What you say is true. Initially I thought he was using an adjacent list model when I saw his cat_parent_id column.
Where I work we all but phased out all of our implementations of the nested set model (left right node) in favor of the adjacent list model (predecessor_id). We were using them to store relationships which changed frequently. When we have a table with over a million records, we couldn't afford to update half a million records just to insert a single node near the top of our tree. It would bring our production environment to a grinding halt. :) ~Brad -----Original Message----- From: Barney Boisvert [mailto:[EMAIL PROTECTED] Sent: Tuesday, January 31, 2006 10:42 AM To: CF-Talk Subject: Re: Nested Set Model The main advantage of the nested set model is that you don't have to use recursion or loops to get data out. Consequently it's very fast to recall stuff. Reorganizing the tree is more expensive than other storage mechanisms, but pulling stuff out is hella fast. By and large, you can get any piece of data out with a single query (possibly using a subquery as well). cheers, barneyb On 1/30/06, Brad Wood <[EMAIL PROTECTED]> wrote: > 1. Recursion > or > 2. A while loop over a table variable > > ~Brad > > ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~| Message: http://www.houseoffusion.com/lists.cfm/link=i:4:230858 Archives: http://www.houseoffusion.com/cf_lists/threads.cfm/4 Subscription: http://www.houseoffusion.com/lists.cfm/link=s:4 Unsubscribe: http://www.houseoffusion.com/cf_lists/unsubscribe.cfm?user=11502.10531.4 Donations & Support: http://www.houseoffusion.com/tiny.cfm/54
