*** a/src/backend/access/gist/README
--- b/src/backend/access/gist/README
***************
*** 110,116 **** particularly, it is now a single-pass algorithm.
  Function findLeaf is used to identify subtree for insertion. Page, in which
  insertion is proceeded, is locked as well as its parent page. Functions
  findParent and findPath are used to find parent pages, which could be changed
! because of concurrent access. Function pageSplit is reccurrent and could split
  page by more than 2 pages, which could be necessary if keys have different
  lengths or more than one key are inserted (in such situation, user defined
  function pickSplit cannot guarantee free space on page).
--- 110,116 ----
  Function findLeaf is used to identify subtree for insertion. Page, in which
  insertion is proceeded, is locked as well as its parent page. Functions
  findParent and findPath are used to find parent pages, which could be changed
! because of concurrent access. Function pageSplit is recurrent and could split
  page by more than 2 pages, which could be necessary if keys have different
  lengths or more than one key are inserted (in such situation, user defined
  function pickSplit cannot guarantee free space on page).