Re: plan time of MASSIVE partitioning ...
Tom Lane <tgl@sss.pgh.pa.us>
From: Tom Lane <tgl@sss.pgh.pa.us>
To: Alvaro Herrera <alvherre@commandprompt.com>
Cc: Leonardo Francalanci <m_lists@yahoo.it>, Boszormenyi Zoltan <zb@cybertec.at>, pgsql-hackers Hackers <pgsql-hackers@postgresql.org>
Date: 2010-10-29T19:37:39Z
Lists: pgsql-hackers
Alvaro Herrera <alvherre@commandprompt.com> writes: > Excerpts from Tom Lane's message of vie oct 29 14:15:55 -0300 2010: >> samples % symbol name >> 447433 47.1553 get_tabstat_entry > Is there a reason for keeping the pgstat info in plain lists? Yeah: anything else loses for small numbers of tables per query, which is the normal case. I'd guess you'd need ~100 tables touched in a single transaction before a hashtable is even worth thinking about. We could possibly adopt a solution similar to the planner's approach for joinrels: start with a simple list, and switch over to hashing if the list gets too long. But I'm really doubtful that it's worth the code space. Even with Zoltan's 500-or-so-table case, this wasn't on the radar screen. regards, tom lane