Re: New style of hash join proposal
От | Gregory Stark |
---|---|
Тема | Re: New style of hash join proposal |
Дата | |
Msg-id | 87d4ptawwu.fsf@oxford.xeocode.com обсуждение исходный текст |
Ответ на | Re: New style of hash join proposal (Tom Lane <tgl@sss.pgh.pa.us>) |
Ответы |
Re: New style of hash join proposal
|
Список | pgsql-hackers |
"Tom Lane" <tgl@sss.pgh.pa.us> writes: > Gregory Stark <stark@enterprisedb.com> writes: >> "Tom Lane" <tgl@sss.pgh.pa.us> writes: >>> I don't understand which part of "we can do that now" isn't clear to you. > >> Uh, except we can't. > > I already demonstrated that we could. If the problem is that the > planner is cutting over from one plan type to the other at the wrong > rowcount because of bad cost estimates, that's a different issue > altogether. We seem to be talking past each other. The plan you showed is analogous but using a plain old index scan. That means it has to look up each matching record in a separate index scan, potentially repeatedly. A bitmap index scan would be able to look up precisely the elements in the hash in sequential order and precisely once. -- Gregory Stark EnterpriseDB http://www.enterprisedb.com Get trained by Bruce Momjian - ask me about EnterpriseDB'sPostgreSQL training!
В списке pgsql-hackers по дате отправления: