On Tue, Apr 11, 2017 at 2:17 AM, Alexander Korotkov
> FYI, I've implemented this algorithm for pgsphere. See following branch.
> 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.
> You also can find some experimental evaluation here:
Do you have a sense of how this might compare with range merge join?
Sent via pgsql-hackers mailing list (email@example.com)
To make changes to your subscription: