Re: [HACKERS] Merge join for GiST
От | Jeff Davis |
---|---|
Тема | Re: [HACKERS] Merge join for GiST |
Дата | |
Msg-id | CAMp0ubc6Lxe6BKg5L85_tk3HTJqqdNzctMcagcfnRiG9YoUMNA@mail.gmail.com обсуждение исходный текст |
Ответ на | Re: [HACKERS] Merge join for GiST (Alexander Korotkov <a.korotkov@postgrespro.ru>) |
Ответы |
Re: [HACKERS] Merge join for GiST
|
Список | pgsql-hackers |
On Tue, Apr 11, 2017 at 2:17 AM, Alexander Korotkov <a.korotkov@postgrespro.ru> wrote: > FYI, I've implemented this algorithm for pgsphere. See following branch. > https://github.com/akorotkov/pgsphere/tree/experimental > It's implemented as crossmatch() function which takes as arguments names of > two indexes over spoint and maximum distance (it checks not overlapping but > proximity of points). This function returns setof pairs of TIDs. > > Later, Dmitry Ivanov made it a custom scan node. > https://github.com/akorotkov/pgsphere/tree/crossmatch_cnode > > You also can find some experimental evaluation here: > http://www.adass2016.inaf.it/images/presentations/10_Korotkov.pdf Do you have a sense of how this might compare with range merge join? Regards, Jeff Davis
В списке pgsql-hackers по дате отправления: