| 211 | | /* |
| 212 | | * Support routine for gistnext. Deals with concurrency control issues to |
| 213 | | * check if a node on the (cached) search stack was split by a concurrent |
| 214 | | * inserter. If so, the result of the split can be found by adding right-hand |
| 215 | | * neighbors of the split node to the search stack. See |
| 216 | | * Kornacker/Mohan/Hellerstein, SIGMOD 1997, for the protocol description. |
| | 211 | /* |
| | 212 | * Support routine for gistnext. Deals with concurrency control issues to |
| | 213 | * check if the top node on the search stack was split by a concurrent |
| | 214 | * inserter since the time it was put on the stack. If so, the "rest" |
| | 215 | * of the split can be found by adding the right-hand |
| | 216 | * neighbor of the split node to the search stack. See |
| | 217 | * Kornacker/Mohan/Hellerstein, SIGMOD 1997, for details. |