diff options
| author | John Naylor <john.naylor@postgresql.org> | 2025-11-06 16:35:40 +0700 |
|---|---|---|
| committer | John Naylor <john.naylor@postgresql.org> | 2025-11-06 16:35:40 +0700 |
| commit | 07b3df5d00cb01b024ee3c080cf15cee69ee3d95 (patch) | |
| tree | f4755579e2fd5059701351a269d13153e68ec7c1 /src | |
| parent | 5a4eba558aa76c36ecf2aab7587b233c0e2003e2 (diff) | |
Cosmetic fixes in GiST README
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
Diffstat (limited to 'src')
| -rw-r--r-- | src/backend/access/gist/README | 8 |
1 files changed, 4 insertions, 4 deletions
diff --git a/src/backend/access/gist/README b/src/backend/access/gist/README index 8015ff19f05..76e0e11f228 100644 --- a/src/backend/access/gist/README +++ b/src/backend/access/gist/README @@ -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 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 -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, 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 -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 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 @@ -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 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 -page, re-check that the child page is still empty. Then, we remove the -downlink and mark the child as deleted, and release the locks. +page and re-check that the child page is still empty. Then we remove the +downlink, mark the child as deleted, and release the locks. 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 |