On Thu, Feb 16, 2006 at 09:22:13PM -0800, SanjayK wrote: > > Fascinating! I got another reply too by email pointing to the book by Joe > Celko.
Also try searching the SQLite archives, e.g.: http://www.mail-archive.com/sqlite-users@sqlite.org/msg05235.html There are probably many other relevent posts as well. (Unfortunately, the search functions on the existing mailing list archives seem to be rather poor, you can search for "Hierarchical", "connect", or "by", but not for the phrase "connect by".) I'm not really familiar with that "Tree Sortkey" technique, but here are a few more links about it, (which in turn include some links to other techniques as well): http://openacs.org/doc/current/tutorial-hierarchical.html http://rubick.com/openacs/tree_sortkey http://openacs.org/forums/message-view?message_id=143978 I think another name for the basic "Tree Sortkey" technique is the "m-vgID method" as described by Miguel Sofer: http://openacs.org/forums/message-view?message_id=18365 http://openacs.org/forums/message-view?message_id=104242 http://www.utdt.edu/~mig/sql-trees/ Reportedly (according to Dan Wickstrom in 2001, who I'm pretty sure knew what he was talking about): "This method provides the flexiblity of the nested set model, and it doesn't suffer from the same performance problems on insert/update operations. In addition, the implementation is simpler." -- Andrew Piskorski <[EMAIL PROTECTED]> http://www.piskorski.com/
