On Mon, 2008-11-17 at 22:30 +0100, Fabio Natali wrote: > Hi Malcom! And thank you very much for your kind reply. > > Malcolm Tredinnick wrote: > [...] > > 500 leaves is really nothing for the database. If you want to do > > anything with that size tree, you can easily just use a simple nested > > hierarchy like this, pull all the rows back into Python and work with > > them there. Particularly since you only have three levels in the tree: > > queries on name or parent__name or parent__parent__name are as bad as > > it's going to get (thereby meaning you can often filter to just the > > branches you want). > > Sorry Malcom, but I am not a native and I am not 100% sure I got your > line. When you say "a simple nested hierarchy like this", do you refer > to my naive adjacency list implementation?
Sorry. Yes, that's exactly what I meant. When I wrote "simple" I meant "without any extra information to determine the position". After all, all the extra information in other ways of representing trees is just redundant information to speed up certain operations (often at the cost of other operations). Regards, Malcolm --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Django users" group. To post to this group, send email to django-users@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/django-users?hl=en -~----------~----~----~----~------~----~------~--~---
