Re: [PERFORM] "Hash index" vs. "b-tree index" (PostgreSQL 8.0)

Поиск
Список
Период
Сортировка
От Christopher Petrilli
Тема Re: [PERFORM] "Hash index" vs. "b-tree index" (PostgreSQL 8.0)
Дата
Msg-id 59d991c405050908271b55e673@mail.gmail.com
обсуждение исходный текст
Ответ на Re: "Hash index" vs. "b-tree index" (PostgreSQL 8.0)  (Neil Conway <neilc@samurai.com>)
Ответы Re: [PERFORM] "Hash index" vs. "b-tree index" (PostgreSQL
Список pgsql-general
On 5/9/05, Neil Conway <neilc@samurai.com> wrote:
> I don't think we've found a case in which the hash index code
> outperforms B+-tree indexes, even for "=". The hash index code also has
> a number of additional issues: for example, it isn't WAL safe, it has
> relatively poor concurrency, and creating a hash index is significantly
> slower than creating a b+-tree index.

This being the case, is there ever ANY reason for someone to use it?
If not, then shouldn't we consider deprecating it and eventually
removing it.  This would reduce complexity, I think.

Chris
--
| Christopher Petrilli
| petrilli@gmail.com

В списке pgsql-general по дате отправления: