3 ms·
That's only viable when you have a small data set, which is when you don't care much about indexing to begin with.
by klodolph 9y ago
That's only viable when you have a small data set, which is when you don't care much about indexing to begin with.
- dvirsky 9y agoSounds like GeoHash lookup which is actually pretty robust if you have a good data structure for indexing. For example: https://redis.io/commands/georadius https://redis.io/commands/georadius
- geophile 9y agoHuh? I've used z-order inside database systems, with many millions of records. Works incredibly well.
- gmueckl 9y agoBuilding and balancing a k-d tree is not free, either. I suspect that the GP's approach is roughly the same in terms of theoretical complexity, but effectively trades memory for smaller constants and a chance to trip over edge cases like dense groups of points.