database/postgres
1
0
Fork 0
mirror of https://github.com/postgres/postgres.git synced 2025-06-13 07:41:39 +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

70
contrib/btree_gist/btree_enum.c
View File

@ -26,6 +26,7 @@ PG_FUNCTION_INFO_V1(gbt_enum_picksplit);
PG_FUNCTION_INFO_V1(gbt_enum_consistent);
PG_FUNCTION_INFO_V1(gbt_enum_penalty);
PG_FUNCTION_INFO_V1(gbt_enum_same);
PG_FUNCTION_INFO_V1(gbt_enum_sortsupport);
static bool
@ -183,3 +184,72 @@ gbt_enum_same(PG_FUNCTION_ARGS)
*result = gbt_num_same((void *) b1, (void *) b2, &tinfo, fcinfo->flinfo);
PG_RETURN_POINTER(result);
}
static int
gbt_enum_sort_build_cmp(Datum a, Datum b, SortSupport ssup)
{
oidKEY *ia = (oidKEY *) DatumGetPointer(a);
oidKEY *ib = (oidKEY *) DatumGetPointer(b);
/* for leaf items we expect lower == upper */
Assert(ia->lower == ia->upper);
Assert(ib->lower == ib->upper);
if (ia->lower == ib->lower)
return 0;
return (ia->lower > ib->lower) ? 1 : -1;
}
static Datum
gbt_enum_abbrev_convert(Datum original, SortSupport ssup)
{
oidKEY *b1 = (oidKEY *) DatumGetPointer(original);
return ObjectIdGetDatum(b1->lower);
}
static int
gbt_enum_cmp_abbrev(Datum z1, Datum z2, SortSupport ssup)
{
Oid a = DatumGetObjectId(z1);
Oid b = DatumGetObjectId(z2);
if (a > b)
return 1;
else if (a < b)
return -1;
else
return 0;
}
/*
* We never consider aborting the abbreviation.
*/
static bool
gbt_enum_abbrev_abort(int memtupcount, SortSupport ssup)
{
return false;
}
/*
* Sort support routine for fast GiST index build by sorting.
*/
Datum
gbt_enum_sortsupport(PG_FUNCTION_ARGS)
{
SortSupport ssup = (SortSupport) PG_GETARG_POINTER(0);
if (ssup->abbreviate)
{
ssup->comparator = gbt_enum_cmp_abbrev;
ssup->abbrev_converter = gbt_enum_abbrev_convert;
ssup->abbrev_abort = gbt_enum_abbrev_abort;
ssup->abbrev_full_comparator = gbt_enum_sort_build_cmp;
}
else
{
ssup->comparator = gbt_enum_sort_build_cmp;
}
PG_RETURN_VOID();
}