TopicMailing ListsActivityParticipants
6 commits
Add "split after new tuple" nbtree optimization.
master12beta1REL_19_STABLE12beta1REL_18_STABLE12beta1REL_17_STABLE12beta1REL_16_STABLE12beta1REL_15_STABLE12beta1REL_14_STABLE12beta1REL_13_STABLE12beta1+1 more
Add nbtree high key "continuescan" optimization.
master12beta1REL_19_STABLE12beta1REL_18_STABLE12beta1REL_17_STABLE12beta1REL_16_STABLE12beta1REL_15_STABLE12beta1REL_14_STABLE12beta1REL_13_STABLE12beta1+1 more
Allow amcheck to re-find tuples using new search.
master12beta1REL_19_STABLE12beta1REL_18_STABLE12beta1REL_17_STABLE12beta1REL_16_STABLE12beta1REL_15_STABLE12beta1REL_14_STABLE12beta1REL_13_STABLE12beta1+1 more
Consider secondary factors during nbtree splits.
master12beta1REL_19_STABLE12beta1REL_18_STABLE12beta1REL_17_STABLE12beta1REL_16_STABLE12beta1REL_15_STABLE12beta1REL_14_STABLE12beta1REL_13_STABLE12beta1+1 more
Make heap TID a tiebreaker nbtree index column.
master12beta1REL_19_STABLE12beta1REL_18_STABLE12beta1REL_17_STABLE12beta1REL_16_STABLE12beta1REL_15_STABLE12beta1REL_14_STABLE12beta1REL_13_STABLE12beta1+1 more
+1 more
2019-03Committed
Patch#1787
CINot processed
ReviewersHeikki Linnakangas (heikki), Andrei Lepikhov (lepikhov)
CommitterPeter Geoghegan (pgeoghegan)
Making all nbtree entries unique by having heap TIDs participate in comparisons
Making all nbtree entries unique by having heap TIDs participate in comparisons
hackers
123 replies
Apr 01, 2019
Peter GeogheganHeikki LinnakangasAndrei LepikhovRobert HaasAndres Freund+5