File tree 2 files changed +5
-4
lines changed
2 files changed +5
-4
lines changed Original file line number Diff line number Diff line change @@ -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 NSN to the LSN that the parent had when visited. If it did, the
96
- sibling page is immediately added to the front of the queue, ensuring that
97
- its items will be scanned in the same 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, the sibling page is immediately
97
+ added to the front of the queue, 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
Original file line number Diff line number Diff line change 51
51
#define F_HAS_GARBAGE (1 << 4) /* some tuples on the page are dead,
52
52
* but not deleted yet */
53
53
54
+ /* NSN - node sequence number, a special-purpose LSN */
54
55
typedef XLogRecPtr GistNSN ;
55
56
56
57
/*
You can’t perform that action at this time.
0 commit comments