MPTtree, Hieararchical trees in a database table |
[eluser]ntheorist[/eluser]
I found an interesting article regarding nested sets: http://explainextended.com/2009/09/29/ad...ets-mysql/ apparently you can speed up access of nested set queries by defining the left & right columns as spatial indexes. Any thoughts on how difficult it would be to implement this? Also the idea of also recording a level column for cases when adjacency-type queries would be faster is interesting. _n |
Welcome Guest, Not a member yet? Register Sign In |