Re: Making all nbtree entries unique by having heap TIDs participate in comparisons

Peter Geoghegan <pg@bowt.ie>

From: Peter Geoghegan <pg@bowt.ie>

To: Andres Freund <andres@anarazel.de>

Cc: "Andrey V. Lepikhov" <a.lepikhov@postgrespro.ru>, Peter Eisentraut <peter.eisentraut@2ndquadrant.com>, PostgreSQL Hackers <pgsql-hackers@postgresql.org>, Alexander Korotkov <a.korotkov@postgrespro.ru>, Thomas Munro <thomas.munro@enterprisedb.com>, Claudio Freire <klaussfreire@gmail.com>, Anastasia Lubennikova <a.lubennikova@postgrespro.ru>

Date: 2018-10-18T20:46:21Z

Lists: pgsql-hackers

Shared_buffers is 10gb iirc. The server has 32gb of memory. Yes, 'public'
is the patch case. Sorry for not mentioning it initially.

--
Peter Geoghegan
(Sent from my phone)

Commits

Add "split after new tuple" nbtree optimization.
- f21668f328c8 12.0 landed
Add nbtree high key "continuescan" optimization.
- 29b64d1de7c7 12.0 landed
Allow amcheck to re-find tuples using new search.
- c1afd175b5b2 12.0 landed
Consider secondary factors during nbtree splits.
- fab250243387 12.0 landed
Make heap TID a tiebreaker nbtree index column.
- dd299df8189b 12.0 landed
Refactor nbtree insertion scankeys.
- e5adcb789d80 12.0 landed
Redesign the partition dependency mechanism.
- 1d92a0c9f7dd 12.0 cited
Avoid unnecessary palloc overhead in _bt_first(). The temporary
- d961a5689966 8.1.0 cited