On Sat, Jan 31, 2009 at 11:37 PM, Robert Haas <[email protected]> wrote: > I've been doing some benchmarking and profiling on the PostgreSQL > query analyzer, and it seems that (at least for the sorts of queries > that I typically run) the dominant cost is add_path(). I've been able > to find two optimizations that seem to help significantly: > > 1. add_path() often calls compare_fuzzy_path_costs() twice on the same > > 2. match_unsorted_outer() adds as many as 5 nested loop joins at a
if there are two optimizations maybe two different patches are better to test them individually -- Atentamente, Jaime Casanova Soporte y capacitación de PostgreSQL AsesorÃa y desarrollo de sistemas Guayaquil - Ecuador Cel. +59387171157 -- Sent via pgsql-hackers mailing list ([email protected]) To make changes to your subscription: http://www.postgresql.org/mailpref/pgsql-hackers
