We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see ourdocumentation.
There was an error while loading.Please reload this page.
1 parent3d0b4b1 commit5b14ec0Copy full SHA for 5b14ec0
src/backend/access/nbtree/README
@@ -99,9 +99,9 @@ cannot miss any items it should have seen, nor accidentally return the same
99
item twice. The scan must remember the page's right-link at the time it
100
was scanned, since that is the page to move right to; if we move right to
101
the current right-link then we'd re-scan any items moved by a page split.
102
-Wedon't similarlyremember the left-link,since it's best to use the most
103
-up-to-date left-link when tryingtomove left (see detailed move-left
104
-algorithm below).
+Wealsoremember the left-link,and follow it when the scan moves backwards
+(though this requires extra handlingtoaccount for concurrent splits of
+the left sibling; see detailed move-leftalgorithm below).
105
106
In most cases we release our lock and pin on a page before attempting
107
to acquire pin and lock on the page we are moving to. In a few places