Oh, I totally understand that one. It's definitely a cumbersome problem to solve, because the execution profiles are so different. If data isn't changing too frequently, aggressive caching can pretty much negate the cost of the adjacency list, but again, that's not applicable in all situations either.
cheers, barneyb On 1/31/06, Brad Wood <[EMAIL PROTECTED]> wrote: > 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 > -- Barney Boisvert [EMAIL PROTECTED] 360.319.6145 http://www.barneyb.com/ Got Gmail? I have 100 invites. ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~| Message: http://www.houseoffusion.com/lists.cfm/link=i:4:230859 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
