You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
For parallelizing clustering algorithms at scale, it would be very useful to have an optimized join query between sets of points to find pairs of points that are within distance X from one another (similar to the Distance Join in the GeoSpark-SQL project)
One can achieve that by building polygons around one set of points and then using the "point within polygon" query, but this seems wasteful.
Any plans for such a join?
thanks!
The text was updated successfully, but these errors were encountered:
For parallelizing clustering algorithms at scale, it would be very useful to have an optimized join query between sets of points to find pairs of points that are within distance X from one another (similar to the Distance Join in the GeoSpark-SQL project)
One can achieve that by building polygons around one set of points and then using the "point within polygon" query, but this seems wasteful.
Any plans for such a join?
thanks!
The text was updated successfully, but these errors were encountered: