database/postgres
1
0
Fork 0
mirror of https://github.com/postgres/postgres.git synced 2025-11-07 19:06:32 +03:00
Code Activity

Cosmetic fixes in GiST README

Browse Source 
Fix a typo, add some missing conjunctions, and make a sentence flow
more smoothly.

Author: Paul A. Jungwirth <pj@illuminatedcomputing.com>
Discussion: https://postgr.es/m/CA%2BrenyXZgwzegmO5t%3DUSU%3D9Wo5bc-YqNf-6E7Nv7e577DCmYXA%40mail.gmail.com
This commit is contained in:
John Naylor
2025-11-06 16:35:40 +07:00
parent 5a4eba558a
commit 07b3df5d00
1 changed files with 4 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
src/backend/access/gist/README
View File

@@ -172,7 +172,7 @@ it splits the page, and constructs the new downlink tuples for the split
pages. The caller must then call gistplacetopage() on the parent page to pages. The caller must then call gistplacetopage() on the parent page to
insert the downlink tuples. The parent page that holds the downlink to insert the downlink tuples. The parent page that holds the downlink to
the child might have migrated as a result of concurrent splits of the the child might have migrated as a result of concurrent splits of the
parent, gistFindCorrectParent() is used to find the parent page. parent, so gistFindCorrectParent() is used to find the parent page.
Splitting the root page works slightly differently. At root split, Splitting the root page works slightly differently. At root split,
gistplacetopage() allocates the new child pages and replaces the old root gistplacetopage() allocates the new child pages and replaces the old root
@@ -291,7 +291,7 @@ Buffering build algorithm
------------------------- -------------------------
In the buffering index build algorithm, some or all internal nodes have a In the buffering index build algorithm, some or all internal nodes have a
buffer attached to them. When a tuple is inserted at the top, the descend down buffer attached to them. When a tuple is inserted at the top, the descent down
the tree is stopped as soon as a buffer is reached, and the tuple is pushed to the tree is stopped as soon as a buffer is reached, and the tuple is pushed to
the buffer. When a buffer gets too full, all the tuples in it are flushed to the buffer. When a buffer gets too full, all the tuples in it are flushed to
the lower level, where they again hit lower level buffers or leaf pages. This the lower level, where they again hit lower level buffers or leaf pages. This
@@ -455,8 +455,8 @@ be reused. In order to delete an empty page, its downlink must be removed from
the parent. We scan all the internal pages, whose block numbers we memorized the parent. We scan all the internal pages, whose block numbers we memorized
in the first stage, and look for downlinks to pages that we have memorized as in the first stage, and look for downlinks to pages that we have memorized as
being empty. Whenever we find one, we acquire a lock on the parent and child being empty. Whenever we find one, we acquire a lock on the parent and child
page, re-check that the child page is still empty. Then, we remove the page and re-check that the child page is still empty. Then we remove the
downlink and mark the child as deleted, and release the locks. downlink, mark the child as deleted, and release the locks.
The insertion algorithm would get confused, if an internal page was completely The insertion algorithm would get confused, if an internal page was completely
empty. So we never delete the last child of an internal page, even if it's empty. So we never delete the last child of an internal page, even if it's