This adds a new optional support function to the GiST access method: sortsupport. If it is defined, the GiST index is built by sorting all data to the order defined by the sortsupport's comparator function, and packing the tuples in that order to GiST pages. This is similar to how B-tree index build works, and is much faster than inserting the tuples one by one. The resulting index is smaller too, because the pages are packed more tightly, upto 'fillfactor'. The normal build method works by splitting pages, which tends to lead to more wasted space.
The quality of the resulting index depends on how good the opclass-defined sort order is. A good order preserves locality of the input data.
As the first user of this facility, add 'sortsupport' function to the point_ops opclass. It sorts the points in Z-order (aka Morton Code), by interleaving the bits of the X and Y coordinates.
Author: Andrey Borodin
16fa9b2b30 Add support for building GiST index by sorting.
doc/src/sgml/gist.sgml | 70 ++++
src/backend/access/gist/gistbuild.c | 510 ++++++++++++++++++++++++-----
src/backend/access/gist/gistproc.c | 229 +++++++++++++
src/backend/access/gist/gistutil.c | 53 ++-
src/backend/access/gist/gistvalidate.c | 6 +-
src/backend/access/transam/xloginsert.c | 57 ++++
src/backend/utils/sort/sortsupport.c | 34 ++
src/backend/utils/sort/tuplesort.c | 57 ++++
src/include/access/gist.h | 3 +-
src/include/access/gist_private.h | 3 +
src/include/access/xloginsert.h | 2 +
src/include/catalog/catversion.h | 1 +
src/include/catalog/pg_amproc.dat | 2 +
src/include/catalog/pg_proc.dat | 3 +
src/include/utils/sortsupport.h | 1 +
src/include/utils/tuplesort.h | 4 +
src/test/regress/expected/create_index.out | 6 +-
17 files changed, 935 insertions(+), 106 deletions(-)