| From: | Andrew Borodin <borodin(at)octonica(dot)com> |
|---|---|
| To: | Alexander Korotkov <a(dot)korotkov(at)postgrespro(dot)ru> |
| Cc: | Jeff Davis <pgsql(at)j-davis(dot)com>, pgsql-hackers <pgsql-hackers(at)postgresql(dot)org>, Sergey Mirvoda <sergey(at)mirvoda(dot)com> |
| Subject: | Re: Merge join for GiST |
| Date: | 2017-04-11 17:46:57 |
| Message-ID: | CAJEAwVF5p76H=oxfWXsz1=+gB4Qe91kdmLz5hBAVTN1JtWTm5w@mail.gmail.com |
| Views: | Raw Message | Whole Thread | Download mbox | Resend email |
| Thread: | |
| Lists: | pgsql-hackers |
2017-04-11 14:17 GMT+05:00 Alexander Korotkov <a(dot)korotkov(at)postgrespro(dot)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.
| From | Date | Subject | |
|---|---|---|---|
| Next Message | Tom Lane | 2017-04-11 17:57:04 | Re: Possible problem in Custom Scan API |
| Previous Message | Robert Haas | 2017-04-11 17:41:52 | Re: Partitioned tables and relfilenode |