News for hackers. Stuff that matters.
Re:Z-order curve usage to decrease dimensionality to 1 by zocoi on Monday June 12, 2017 @09:43PM (#14542402)
Can someone help explaining why this hash method could improve distance calculation for k-NN? What does it improve compared with Geohash or k-d tree structure?
Re:Z-order curve usage to decrease dimensionality to 1 by imron on Monday June 12, 2017 @11:15PM (#14542653)
> What does it improve compared with Geohash

From what I can tell, it's the exact same algorithm used by Geohash.

Re:Z-order curve usage to decrease dimensionality to 1 by mmalone on Tuesday June 13, 2017 @12:23PM (#14545972)
Yep. Geohash is just a fancy name for a z-curve.
Re:Z-order curve usage to decrease dimensionality to 1 by mmalone on Tuesday June 13, 2017 @12:28PM (#14546010)
1. A geohash is a z-curve.

2. It won't be better than a k-d tree. Dimensionality reduction is usually done when you have really truly huge numbers of dimensions that are sparsely populated and you don't care much about some information loss (e.g., for machine learning) or, in this case, when you have an easy way to create a single dimensional index and you want to force multi-dimensional data into it. In the general case a k-d tree would be objectively better in terms of performance.

Re:Z-order curve usage to decrease dimensionality to 1 by AstralStorm on Tuesday June 13, 2017 @12:40PM (#14546134)
And in very many or highly sparse dimensions with few or lazy updates, R-tree or derivatives.