Re: external sort performance

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

 



> The first log statement is expected. The second log statement, however, isn't.
> The total table size is (as noted earlier) about 5GB and, in fact, fit
> into one nice hash table (approx 15GB in size).
> Is the sorting that is necessary for index creation unable to use a
> hash table? (This is a standard btree index).

How big is the source table?  You're not sorting the *result* table,
you're sorting the source table if you're summarizing it.

If the original source data is only 5GB, I'd check your code for a
cartesian join.

-- 
Josh Berkus
PostgreSQL Experts Inc.
http://pgexperts.com

-- 
Sent via pgsql-performance mailing list (pgsql-performance@xxxxxxxxxxxxxx)
To make changes to your subscription:
http://www.postgresql.org/mailpref/pgsql-performance


[Postgresql General]     [Postgresql PHP]     [PHP Users]     [PHP Home]     [PHP on Windows]     [Kernel Newbies]     [PHP Classes]     [PHP Books]     [PHP Databases]     [Yosemite]

  Powered by Linux