diff options
Diffstat (limited to 'src/backend/access/spgist/README')
| -rw-r--r-- | src/backend/access/spgist/README | 6 |
1 files changed, 5 insertions, 1 deletions
diff --git a/src/backend/access/spgist/README b/src/backend/access/spgist/README index 09ab21af264..b55b0738320 100644 --- a/src/backend/access/spgist/README +++ b/src/backend/access/spgist/README @@ -41,7 +41,11 @@ contain exactly one inner tuple. When the search traversal algorithm reaches an inner tuple, it chooses a set of nodes to continue tree traverse in depth. If it reaches a leaf page it -scans a list of leaf tuples to find the ones that match the query. +scans a list of leaf tuples to find the ones that match the query. SP-GiST +also supports ordered (nearest-neighbor) searches - that is during scan pending +nodes are put into priority queue, so traversal is performed by the +closest-first model. + The insertion algorithm descends the tree similarly, except it must choose just one node to descend to from each inner tuple. Insertion might also have |