Seen this before. The solution is rather lame, as most of the logic is shifted out to the code, whereas it could have been implemented in the database directly. I have managed to get a move_tree algorythm working rather fast and glitch free by now, yet I am wondering if there are other directions to follow. What I can see as actual are:
* deleting trees * swapping nodes places on one level (including the subtrees) btw, do stored procedures (user functions in other words) have to implement table locking or be carried out inside a transaction such that the nested set indexes remain intact? regards, alex 2005/4/16, Troels Arvin <[EMAIL PROTECTED]>: > On Sat, 16 Apr 2005 16:31:43 +0400, A. Kulikov wrote: > > > Has anyone implemented a pretty Nested Sets solution in > > PostgreSQL? > > Maybe this is useful? : > http://threebit.net/tutorials/nestedset/tutorial1.html > > -- > Greetings from Troels Arvin, Copenhagen, Denmark > > ---------------------------(end of broadcast)--------------------------- > TIP 5: Have you checked our extensive FAQ? > > http://www.postgresql.org/docs/faq > -- The mind is essential -- http://essentialmind.com/ ---------------------------(end of broadcast)--------------------------- TIP 7: don't forget to increase your free space map settings
