@@ -92,10 +92,10 @@ index child page to be split between the time we make a queue entry for it
92
92
(while visiting its parent page) and the time we actually reach and scan
93
93
the child page. To avoid missing the entries that were moved to the right
94
94
sibling, we detect whether a split has occurred by comparing the child
95
- page's NSNto the LSN that the parent had when visited. If it did, the
96
- sibling page is immediately added to the front of thequeue, ensuring that
97
- its items will be scanned in thesame order as if they were still on the
98
- original child page.
95
+ page's NSN(node sequence number, a special-purpose LSN) to the LSN that
96
+ the parent had when visited. If it did, thesibling page is immediately
97
+ added to the front of thequeue, ensuring that its items will be scanned
98
+ in the same order as if they were still on the original child page.
99
99
100
100
As is usual in Postgres, the search algorithm only guarantees to find index
101
101
entries that existed before the scan started; index entries added during