How would this work internally? What queries would be generated? How many queries would be generated? At what points in time would queries be "executed"? Would that be a "lazy" execution?
We have many such tables in our project, so this is a big interest of ours to have this work as best it can. The "straight forward" way of querying hierarchical queries is horribly inefficient. We already have a case that ends-up generating over 7K queries for a single view... Even with connection-pooling it takes almost 30 seconds. After moving postgres to a ramdisk, and adding a local PGBouncer server, that dropped to 14s. But obviously this is not a solution. The way we thought of solving that, is have other field(s) against which a single query could be issued, and then have the tree-structuring done in python. Is this the approach this solution is taking? -- Resources: - http://web2py.com - http://web2py.com/book (Documentation) - http://github.com/web2py/web2py (Source code) - https://code.google.com/p/web2py/issues/list (Report Issues) --- You received this message because you are subscribed to the Google Groups "web2py-users" group. To unsubscribe from this group and stop receiving emails from it, send an email to web2py+unsubscr...@googlegroups.com. For more options, visit https://groups.google.com/groups/opt_out.
