Re: [sqlalchemy] Optimizing performance of hierarchical data structure loading

Something that I have done is to store a node path in the table. This might not be the best from a normalization perspective, but in my case I am storing file paths so one might argue the full path is the key. The advantage is that it becomes very easy/fast to query for all the nodes below or

[sqlalchemy] Optimizing performance of hierarchical data structure loading

Hi list, I've got a tree-type of data, representing somewhat of a method call history. When this is loaded, in an instance where it represents about 60 entries total, up to 2 deep, representing 14k of data, it takes about 9 seconds (up from ~0). Now, my laptop HDD where I am testing now is pretty

Re: [sqlalchemy] Optimizing performance of hierarchical data structure loading

On Sep 5, 2010, at 7:41 PM, Alec Munro wrote: Hi list, I've got a tree-type of data, representing somewhat of a method call history. When this is loaded, in an instance where it represents about 60 entries total, up to 2 deep, representing 14k of data, it takes about 9 seconds (up from ~0).