Re: [HACKERS] Merge join for GiST
От | Andrew Borodin |
---|---|
Тема | Re: [HACKERS] Merge join for GiST |
Дата | |
Msg-id | CAJEAwVF5p76H=oxfWXsz1=+gB4Qe91kdmLz5hBAVTN1JtWTm5w@mail.gmail.com обсуждение исходный текст |
Ответ на | Re: [HACKERS] Merge join for GiST (Alexander Korotkov <a.korotkov@postgrespro.ru>) |
Список | pgsql-hackers |
2017-04-11 14:17 GMT+05:00 Alexander Korotkov <a.korotkov@postgrespro.ru>: > 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 > > Feel free to experiment with this code and/or ask any question. Wow, that's cool! Thanks! That code actually answers a lot of questions. I'll try to generalize that for && operator Best regards, Andrey Borodin.
В списке pgsql-hackers по дате отправления: