DSDoogal Simpsonindoogal.dev00Scalable Proximity Search: Why Geohashing Beats Radius Queries6d ago · 5 min read · TL;DR: Geohashing maps 2D coordinates to a 1D string using recursive binary partitioning and bit interleaving. By encoding these bits into a Base-32 string, we leverage B-Tree prefix matching for effiJoin discussion
DSDoogal Simpsonindoogal.dev00Beyond the Haversine Formula: Why I Use Geohashing for Spatial Search6d ago · 5 min read · TL;DR: Geohashing encodes 2D coordinates into hierarchical string prefixes, transforming expensive O(n) geometric calculations into efficient indexed lookups. By mapping geographic areas to unique strJoin discussion