Re: Yet another fast GiST build
От | Heikki Linnakangas |
---|---|
Тема | Re: Yet another fast GiST build |
Дата | |
Msg-id | cad28d12-d76f-3346-9695-d355d577535b@iki.fi обсуждение исходный текст |
Ответ на | Re: Yet another fast GiST build (Darafei "Komяpa" Praliaskouski <me@komzpa.net>) |
Список | pgsql-hackers |
On 09/09/2020 15:20, Darafei "Komяpa" Praliaskouski wrote: > On Wed, Sep 9, 2020 at 3:09 PM Heikki Linnakangas <hlinnaka@iki.fi> wrote: > >> Come to think of it, the point z-order comparator could benefit a lot >> from key abbreviation, too. You could do the point -> zorder conversion >> in the abbreviation routine. > > That's how it works in PostGIS, only that we moved to more > effecient Hilbert curve: > https://github.com/postgis/postgis/blob/54399b9f6b0f02e8db9444f9f042b8d4ca6d4fa4/postgis/lwgeom_btree.c#L171 Thanks, that's interesting. I implemented the abbreviated keys for the point opclass, too, and noticed that the patch as it was never used it. I reworked the patch so that tuplesort_begin_index_gist() is responsible for looking up the sortsupport function, like tuplesort_begin_index_btree() does, and uses abbreviation when possible. I think this is pretty much ready for commit now. I'll do a bit more testing (do we have regression test coverage for this?), also on a SIZEOF_DATUM==4 system since the abbreviation works differently with that, and push if nothing new comes up. And clarify the documentation and/or comments that the sortsupport function sees "compressed" values. I wonder if we could use sorting to also speed up building tsvector indexes? The values stored there are bit signatures, what would be a good sort order for those? - Heikki
В списке pgsql-hackers по дате отправления: