database/postgres
1
0
Fork 0
mirror of https://github.com/postgres/postgres.git synced 2025-09-02 04:21:28 +03:00
Code Activity

Fix missing word in nbtree/README.

Browse Source 
Reported-by: Daniel Westermann
Author: Gurjeet Singh
Reviewed-by: Richard Guo
Discussion: https://postgr.es/m/ZR0P278MB0427F0E0CE4ED140F52D1923D250A%40ZR0P278MB0427.CHEP278.PROD.OUTLOOK.COM
This commit is contained in:
Nathan Bossart
2023-06-08 21:20:24 -07:00
parent 392ea0c78f
commit 9aee26a491
1 changed files with 3 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
src/backend/access/nbtree/README
View File

@@ -17,9 +17,9 @@ The basic Lehman & Yao Algorithm
Compared to a classic B-tree, L&Y adds a right-link pointer to each page, Compared to a classic B-tree, L&Y adds a right-link pointer to each page,
to the page's right sibling. It also adds a "high key" to each page, which to the page's right sibling. It also adds a "high key" to each page, which
is an upper bound on the keys that are allowed on that page. These two is an upper bound on the keys that are allowed on that page. These two
additions make it possible detect a concurrent page split, which allows the additions make it possible to detect a concurrent page split, which allows
tree to be searched without holding any read locks (except to keep a single the tree to be searched without holding any read locks (except to keep a
page from being modified while reading it). single page from being modified while reading it).
When a search follows a downlink to a child page, it compares the page's When a search follows a downlink to a child page, it compares the page's
high key with the search key. If the search key is greater than the high high key with the search key. If the search key is greater than the high