Re: Making all nbtree entries unique by having heap TIDs participatein comparisons
От
Robert Haas
Тема
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons
Дата
Msg-id
CA+TgmoaNO9puEj09+LVnLFhY-pKn=j=QJUnhukBZjGC8EiSnww@mail.gmail.com
Ответ на
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons (Peter Geoghegan)
Список
Дерево обсуждения
Making all nbtree entries unique by having heap TIDs participate in comparisons Peter Geoghegan <pg@bowt.ie>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Robert Haas <robertmhaas@gmail.com>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Peter Geoghegan <pg@bowt.ie>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Claudio Freire <klaussfreire@gmail.com>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Peter Geoghegan <pg@bowt.ie>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Amit Kapila <amit.kapila16@gmail.com>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Peter Geoghegan <pg@bowt.ie>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Amit Kapila <amit.kapila16@gmail.com>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Peter Geoghegan <pg@bowt.ie>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Claudio Freire <klaussfreire@gmail.com>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Peter Geoghegan <pg@bowt.ie>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Peter Geoghegan <pg@bowt.ie>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Andrey Lepikhov <a.lepikhov@postgrespro.ru>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Peter Geoghegan <pg@bowt.ie>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Peter Geoghegan <pg@bowt.ie>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Peter Geoghegan <pg@bowt.ie>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Peter Eisentraut <peter.eisentraut@2ndquadrant.com>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Peter Geoghegan <pg@bowt.ie>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Andrey Lepikhov <a.lepikhov@postgrespro.ru>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Peter Geoghegan <pg@bowt.ie>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Peter Geoghegan <pg@bowt.ie>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Peter Geoghegan <pg@bowt.ie>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Andres Freund <andres@anarazel.de>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Peter Geoghegan <pg@bowt.ie>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Peter Geoghegan <pg@bowt.ie>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Peter Geoghegan <pg@bowt.ie>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Andrey Lepikhov <a.lepikhov@postgrespro.ru>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Peter Geoghegan <pg@bowt.ie>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Andrey Lepikhov <a.lepikhov@postgrespro.ru>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Peter Geoghegan <pg@bowt.ie>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Andrey Lepikhov <a.lepikhov@postgrespro.ru>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Peter Geoghegan <pg@bowt.ie>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Andrey Lepikhov <a.lepikhov@postgrespro.ru>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Peter Geoghegan <pg@bowt.ie>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Peter Geoghegan <pg@bowt.ie>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Peter Geoghegan <pg@bowt.ie>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Dmitry Dolgov <9erthalion6@gmail.com>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Peter Geoghegan <pg@bowt.ie>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Peter Geoghegan <pg@bowt.ie>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Heikki Linnakangas <hlinnaka@iki.fi>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Peter Geoghegan <pg@bowt.ie>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Heikki Linnakangas <hlinnaka@iki.fi>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Peter Geoghegan <pg@bowt.ie>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Peter Geoghegan <pg@bowt.ie>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Heikki Linnakangas <hlinnaka@iki.fi>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Peter Geoghegan <pg@bowt.ie>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Peter Geoghegan <pg@bowt.ie>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Peter Geoghegan <pg@bowt.ie>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Peter Geoghegan <pg@bowt.ie>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Peter Geoghegan <pg@bowt.ie>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Heikki Linnakangas <hlinnaka@iki.fi>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Peter Geoghegan <pg@bowt.ie>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Heikki Linnakangas <hlinnaka@iki.fi>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Peter Geoghegan <pg@bowt.ie>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Robert Haas <robertmhaas@gmail.com>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Peter Geoghegan <pg@bowt.ie>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Heikki Linnakangas <hlinnaka@iki.fi>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Peter Geoghegan <pg@bowt.ie>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Heikki Linnakangas <hlinnaka@iki.fi>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Peter Geoghegan <pg@bowt.ie>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Peter Geoghegan <pg@bowt.ie>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Heikki Linnakangas <hlinnaka@iki.fi>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Peter Geoghegan <pg@bowt.ie>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Heikki Linnakangas <hlinnaka@iki.fi>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Peter Geoghegan <pg@bowt.ie>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Peter Geoghegan <pg@bowt.ie>
Re: Making all nbtree entries unique by having heap TIDs participate in comparisons Peter Geoghegan <pg@bowt.ie>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Andres Freund <andres@anarazel.de>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Peter Geoghegan <pg@bowt.ie>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Andres Freund <andres@anarazel.de>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Peter Geoghegan <pg@bowt.ie>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Heikki Linnakangas <hlinnaka@iki.fi>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Peter Geoghegan <pg@bowt.ie>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Robert Haas <robertmhaas@gmail.com>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Peter Geoghegan <pg@bowt.ie>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Robert Haas <robertmhaas@gmail.com>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Peter Geoghegan <pg@bowt.ie>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Peter Geoghegan <pg@bowt.ie>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Robert Haas <robertmhaas@gmail.com>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Peter Geoghegan <pg@bowt.ie>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Peter Geoghegan <pg@bowt.ie>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Peter Geoghegan <pg@bowt.ie>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Peter Geoghegan <pg@bowt.ie>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Peter Geoghegan <pg@bowt.ie>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Peter Geoghegan <pg@bowt.ie>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Heikki Linnakangas <hlinnaka@iki.fi>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Peter Geoghegan <pg@bowt.ie>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Peter Geoghegan <pg@bowt.ie>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Peter Geoghegan <pg@bowt.ie>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Heikki Linnakangas <hlinnaka@iki.fi>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Peter Geoghegan <pg@bowt.ie>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Heikki Linnakangas <hlinnaka@iki.fi>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Peter Geoghegan <pg@bowt.ie>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Heikki Linnakangas <hlinnaka@iki.fi>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Peter Geoghegan <pg@bowt.ie>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Heikki Linnakangas <hlinnaka@iki.fi>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Peter Geoghegan <pg@bowt.ie>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Heikki Linnakangas <hlinnaka@iki.fi>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Peter Geoghegan <pg@bowt.ie>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Peter Geoghegan <pg@bowt.ie>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Peter Geoghegan <pg@bowt.ie>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Peter Geoghegan <pg@bowt.ie>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Heikki Linnakangas <hlinnaka@iki.fi>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Peter Geoghegan <pg@bowt.ie>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Heikki Linnakangas <hlinnaka@iki.fi>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Peter Geoghegan <pg@bowt.ie>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Peter Geoghegan <pg@bowt.ie>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Peter Geoghegan <pg@bowt.ie>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Peter Geoghegan <pg@bowt.ie>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Peter Geoghegan <pg@bowt.ie>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Heikki Linnakangas <hlinnaka@iki.fi>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Peter Geoghegan <pg@bowt.ie>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Heikki Linnakangas <hlinnaka@iki.fi>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Peter Geoghegan <pg@bowt.ie>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Heikki Linnakangas <hlinnaka@iki.fi>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Peter Geoghegan <pg@bowt.ie>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Peter Geoghegan <pg@bowt.ie>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Peter Geoghegan <pg@bowt.ie>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Peter Geoghegan <pg@bowt.ie>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Peter Geoghegan <pg@bowt.ie>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Alexander Korotkov <a.korotkov@postgrespro.ru>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Peter Geoghegan <pg@bowt.ie>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Andrey Lepikhov <a.lepikhov@postgrespro.ru>
Re: Making all nbtree entries unique by having heap TIDs participatein comparisons Peter Geoghegan <pg@bowt.ie>
On Tue, Mar 12, 2019 at 2:34 PM Peter Geoghegan wrote: > On Tue, Mar 12, 2019 at 11:32 AM Robert Haas wrote: > > If I wanted to try to say this in fewer words, would it be fair to say > > that reducing the size of an index by 40% without changing anything > > else can increase contention on the remaining pages? > > Yes. Hey, I understood something today! I think it's pretty clear that we have to view that as acceptable. I mean, we could reduce contention even further by finding a way to make indexes 40% larger, but I think it's clear that nobody wants that. Now, maybe in the future we'll want to work on other techniques for reducing contention, but I don't think we should make that the problem of this patch, especially because the regressions are small and go away after a few hours of heavy use. We should optimize for the case where the user intends to keep the database around for years, not hours. -- Robert Haas EnterpriseDB: http://www.enterprisedb.com The Enterprise PostgreSQL Company
В списке pgsql-hackers по дате отправления
От: Peter Geoghegan
Дата: