News for hackers. Stuff that matters.
Re:Hierarchical Queries in MySQL (Function substitute for CO... by quassnoi on Tuesday April 12, 2011 @01:44AM (#2436056)
Sure, especially if you nest the sets using a datatype indexable with an R-Tree index: http://explainextended.com/2009/09/29/adjacency-list-vs-nest...

However, nested sets is still very expensive to update which may be a deciding factor if your hierarchy is subject to frequent change (like, a folder-like structure with the folders being moved here and there) and you don't need to query for "all descendants" often.

There are no comments on this comment yet.