database/postgres
1
0
Fork 0
mirror of https://github.com/postgres/postgres.git synced 2025-07-27 12:41:57 +03:00
Code Activity

Add sortsupport for gist_btree opclasses, for faster index builds.

Browse Source 
Commit 16fa9b2b30 introduced a faster way to build GiST indexes, by
sorting all the data. This commit adds the sortsupport functions needed
to make use of that feature for btree_gist.

Author: Andrey Borodin
Discussion: https://www.postgresql.org/message-id/2F3F7265-0D22-44DB-AD71-8554C743D943@yandex-team.ru
This commit is contained in:
Heikki Linnakangas
2021-04-07 13:22:05 +03:00
parent dd13ad9d39
commit 9f984ba6d2
77 changed files with 1530 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

27
contrib/btree_gist/btree_time.c
View File

@ -28,6 +28,7 @@ PG_FUNCTION_INFO_V1(gbt_time_distance);
PG_FUNCTION_INFO_V1(gbt_timetz_consistent);
PG_FUNCTION_INFO_V1(gbt_time_penalty);
PG_FUNCTION_INFO_V1(gbt_time_same);
PG_FUNCTION_INFO_V1(gbt_time_sortsupport);
#ifdef USE_FLOAT8_BYVAL
@ -332,3 +333,29 @@ gbt_time_same(PG_FUNCTION_ARGS)
*result = gbt_num_same((void *) b1, (void *) b2, &tinfo, fcinfo->flinfo);
PG_RETURN_POINTER(result);
}
static int
gbt_time_sort_build_cmp(Datum a, Datum b, SortSupport ssup)
{
timeKEY *ia = (timeKEY *) DatumGetPointer(a);
timeKEY *ib = (timeKEY *) DatumGetPointer(b);
return DatumGetInt32(DirectFunctionCall2(time_cmp,
TimeADTGetDatumFast(ia->lower),
TimeADTGetDatumFast(ib->lower)));
}
/*
* Sort support routine for fast GiST index build by sorting.
*/
Datum
gbt_time_sortsupport(PG_FUNCTION_ARGS)
{
SortSupport ssup = (SortSupport) PG_GETARG_POINTER(0);
ssup->comparator = gbt_time_sort_build_cmp;
ssup->abbrev_converter = NULL;
ssup->abbrev_abort = NULL;
ssup->abbrev_full_comparator = NULL;
PG_RETURN_VOID();
}