Geohash vs Quadtree for location-based services
·1 min
- Primary factors:
- Density or dynamic partitioning: if you care about not having more than X points in a node, Quadtrees allow that. Geohashes are static in that sense.
- Quadtrees are probably better suited for read queries like, “find top X points near Y”. In Geohashes, I’ll probably require recursive queries if density of boxes is low (for e.g., in Yellowstone).
- I think both algorithms will work in all (or most) of the cases.