summaryrefslogtreecommitdiff
path: root/src/backend/access/nbtree/nbtree.c
diff options
context:
space:
mode:
authorAndres Freund2020-08-12 23:03:49 +0000
committerAndres Freund2020-08-12 23:03:49 +0000
commitdc7420c2c9274a283779ec19718d2d16323640c0 (patch)
tree1ec40b9eebbf7913780ac6a7d6193605c25f1aa2 /src/backend/access/nbtree/nbtree.c
parent1f42d35a1d6144a23602b2c0bc7f97f3046cf890 (diff)
snapshot scalability: Don't compute global horizons while building snapshots.
To make GetSnapshotData() more scalable, it cannot not look at at each proc's xmin: While snapshot contents do not need to change whenever a read-only transaction commits or a snapshot is released, a proc's xmin is modified in those cases. The frequency of xmin modifications leads to, particularly on higher core count systems, many cache misses inside GetSnapshotData(), despite the data underlying a snapshot not changing. That is the most significant source of GetSnapshotData() scaling poorly on larger systems. Without accessing xmins, GetSnapshotData() cannot calculate accurate horizons / thresholds as it has so far. But we don't really have to: The horizons don't actually change that much between GetSnapshotData() calls. Nor are the horizons actually used every time a snapshot is built. The trick this commit introduces is to delay computation of accurate horizons until there use and using horizon boundaries to determine whether accurate horizons need to be computed. The use of RecentGlobal[Data]Xmin to decide whether a row version could be removed has been replaces with new GlobalVisTest* functions. These use two thresholds to determine whether a row can be pruned: 1) definitely_needed, indicating that rows deleted by XIDs >= definitely_needed are definitely still visible. 2) maybe_needed, indicating that rows deleted by XIDs < maybe_needed can definitely be removed GetSnapshotData() updates definitely_needed to be the xmin of the computed snapshot. When testing whether a row can be removed (with GlobalVisTestIsRemovableXid()) and the tested XID falls in between the two (i.e. XID >= maybe_needed && XID < definitely_needed) the boundaries can be recomputed to be more accurate. As it is not cheap to compute accurate boundaries, we limit the number of times that happens in short succession. As the boundaries used by GlobalVisTestIsRemovableXid() are never reset (with maybe_needed updated by GetSnapshotData()), it is likely that further test can benefit from an earlier computation of accurate horizons. To avoid regressing performance when old_snapshot_threshold is set (as that requires an accurate horizon to be computed), heap_page_prune_opt() doesn't unconditionally call TransactionIdLimitedForOldSnapshots() anymore. Both the computation of the limited horizon, and the triggering of errors (with SetOldSnapshotThresholdTimestamp()) is now only done when necessary to remove tuples. This commit just removes the accesses to PGXACT->xmin from GetSnapshotData(), but other members of PGXACT residing in the same cache line are accessed. Therefore this in itself does not result in a significant improvement. Subsequent commits will take advantage of the fact that GetSnapshotData() now does not need to access xmins anymore. Note: This contains a workaround in heap_page_prune_opt() to keep the snapshot_too_old tests working. While that workaround is ugly, the tests currently are not meaningful, and it seems best to address them separately. Author: Andres Freund <[email protected]> Reviewed-By: Robert Haas <[email protected]> Reviewed-By: Thomas Munro <[email protected]> Reviewed-By: David Rowley <[email protected]> Discussion: https://postgr.es/m/[email protected]
Diffstat (limited to 'src/backend/access/nbtree/nbtree.c')
-rw-r--r--src/backend/access/nbtree/nbtree.c28
1 files changed, 16 insertions, 12 deletions
diff --git a/src/backend/access/nbtree/nbtree.c b/src/backend/access/nbtree/nbtree.c
index 49a8a9708e3..8fa6ac7296b 100644
--- a/src/backend/access/nbtree/nbtree.c
+++ b/src/backend/access/nbtree/nbtree.c
@@ -808,6 +808,12 @@ _bt_vacuum_needs_cleanup(IndexVacuumInfo *info)
metapg = BufferGetPage(metabuf);
metad = BTPageGetMeta(metapg);
+ /*
+ * XXX: If IndexVacuumInfo contained the heap relation, we could be more
+ * aggressive about vacuuming non catalog relations by passing the table
+ * to GlobalVisCheckRemovableXid().
+ */
+
if (metad->btm_version < BTREE_NOVAC_VERSION)
{
/*
@@ -817,13 +823,12 @@ _bt_vacuum_needs_cleanup(IndexVacuumInfo *info)
result = true;
}
else if (TransactionIdIsValid(metad->btm_oldest_btpo_xact) &&
- TransactionIdPrecedes(metad->btm_oldest_btpo_xact,
- RecentGlobalXmin))
+ GlobalVisCheckRemovableXid(NULL, metad->btm_oldest_btpo_xact))
{
/*
* If any oldest btpo.xact from a previously deleted page in the index
- * is older than RecentGlobalXmin, then at least one deleted page can
- * be recycled -- don't skip cleanup.
+ * is visible to everyone, then at least one deleted page can be
+ * recycled -- don't skip cleanup.
*/
result = true;
}
@@ -1276,14 +1281,13 @@ backtrack:
* own conflict now.)
*
* Backends with snapshots acquired after a VACUUM starts but
- * before it finishes could have a RecentGlobalXmin with a
- * later xid than the VACUUM's OldestXmin cutoff. These
- * backends might happen to opportunistically mark some index
- * tuples LP_DEAD before we reach them, even though they may
- * be after our cutoff. We don't try to kill these "extra"
- * index tuples in _bt_delitems_vacuum(). This keep things
- * simple, and allows us to always avoid generating our own
- * conflicts.
+ * before it finishes could have visibility cutoff with a
+ * later xid than VACUUM's OldestXmin cutoff. These backends
+ * might happen to opportunistically mark some index tuples
+ * LP_DEAD before we reach them, even though they may be after
+ * our cutoff. We don't try to kill these "extra" index
+ * tuples in _bt_delitems_vacuum(). This keep things simple,
+ * and allows us to always avoid generating our own conflicts.
*/
Assert(!BTreeTupleIsPivot(itup));
if (!BTreeTupleIsPosting(itup))