Fredrik Olsson <[EMAIL PROTECTED]> writes:
> I have some quite huge queries, inside functions, so debugging is kind
> of hard. But I have located the query that for some reason gets 4 times
> as slow after an analyze.
Could we see EXPLAIN ANALYZE output for these cases, not just EXPLAIN?
It seem
At 08:37 PM 2/15/2006, Dann Corbit wrote:
Adding some randomness to the selection of the pivot is a known
technique to fix the oddball partitions problem.
True, but it makes QuickSort slower than say MergeSort because of the
expense of the PRNG being called ~O(lgN) times during a sort.
How
I have some quite huge queries, inside functions, so debugging is kind
of hard. But I have located the query that for some reason gets 4 times
as slow after an analyze.
Before analyze the plan for the query is this:
Nested Loop (cost=16.80..34.33 rows=1 width=28)
Join Filter: (ischildof(2, "o
