You might want to check out Massimo's code for Modified Preorder Tree Traversal, which is an extremely efficient way of storing tree structures in a database:
http://groups.google.com/group/web2py/browse_thread/thread/70efddab62dfe73 On Jul 13, 11:59 am, "topher.baron" <topher.ba...@gmail.com> wrote: > I'm looking forward to it. > > On Jul 13, 1:12 pm, Vasile Ermicioi <elff...@gmail.com> wrote: > > > I am developing a solution for my needs, something similar to nested sets, > > if you could wait a few days I think I will be able to share it
