Re: Fast insertion indexes: why no developments

Поиск
Список
Период
Сортировка
От Leonardo Francalanci
Тема Re: Fast insertion indexes: why no developments
Дата
Msg-id 1383062020.34721.YahooMailNeo@web172603.mail.ir2.yahoo.com
обсуждение исходный текст
Ответ на Re: Fast insertion indexes: why no developments  (Tom Lane <tgl@sss.pgh.pa.us>)
Список pgsql-hackers
Дерево обсуждения 
> They should, in theory, be faster than btrees -- O(1) not O(log N) page
> fetches per lookup.  In practice they don't seem to be faster, and
> nobody's bothered to find out exactly why.  Again, this isn't a terribly
> encouraging precedent for implementing some other index type that's
> supposed to (sometimes) be faster than btrees.

Yes, I understand. Which is also why I was curious to know if the "claims" those papers (and the databases using them)
makewere real... 

Thank you everybody for your replies.

Leonardo

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

Предыдущее
От: Leonardo Francalanci
Дата:
Сообщение: Re: Fast insertion indexes: why no developments
Следующее
От: David Johnston
Дата:
Сообщение: Re: How should row-security affects ON UPDATE RESTRICT / CASCADE ?