This article introduces the GeoHash algorithm, explains how latitude and longitude are recursively bisected into binary strings, compressed with Base32, and demonstrates its use for efficiently locating nearby drivers in ride‑hailing services while discussing precision trade‑offs and edge cases.
This article explains the GeoHash algorithm, shows how it converts latitude‑longitude pairs into compact binary strings, demonstrates the encoding process with a concrete example, and discusses how the resulting prefixes can be used to quickly locate nearby users in massive datasets while highlighting remaining edge‑case challenges.
This article explains the GeoHash algorithm, demonstrates how binary subdivision of latitude and longitude yields compact base‑32 strings, and shows how these hashes can efficiently locate nearby ride‑hailing drivers while highlighting precision limitations and edge cases.
This article explains the GeoHash algorithm, describing how latitude‑longitude coordinates are converted into binary strings and Base32 codes, how these codes enable efficient proximity searches such as finding nearby ride‑hailing passengers, and discusses the limitations of the approach.
This article introduces the Beidou Grid Code, its theoretical foundation in GeoSOT, detailed hierarchical encoding rules, implementation challenges using MySQL and JPA, and showcases practical urban management applications such as case reporting, hotspot analysis, indoor positioning, and data security.
Geohash encodes latitude‑longitude pairs into short base‑32 strings by recursively bisecting coordinate ranges and interleaving bits, allowing fast proximity queries via prefix matching, with precision controlled by string length, and is supported natively in Redis and useful for location‑based services.
This article introduces space-filling curves such as Z‑ordering, Hilbert, and XZ‑Ordering, explaining their mapping algorithms and how they transform multidimensional spatial data into one‑dimensional indices for efficient storage and querying in key‑value databases, while discussing challenges and practical examples.
This article explains how Alibaba Xianyu uses GeoHash encoding and optimized spatial indexing to efficiently match billions of user‑posted GPS points with tens of thousands of market‑area polygons, reducing computation from quadrillions to billions of operations through precise point‑polygon algorithms and fast neighbor lookups.
This article explains how Xianyu uses GeoHash‑based spatial indexing, precise and approximate matching, and a rapid neighbor‑search algorithm to efficiently associate billions of GPS‑tagged items with tens of thousands of city‑level business districts, reducing computation from quadrillions to billions of operations.
By encoding billions of GPS points and ten thousand district polygons into GeoHash cells, using exact matches, approximate filtering, neighbor‑cell lookup tables, and a final precise geometry test, the authors cut the required operations from 2×10^20 to about 1.8×10^12, enabling full processing in under a day.
The article explains how geo‑fencing relies on fast point‑in‑polygon checks, compares the basic ray‑casting method with brute‑force performance, and shows how spatial R‑tree indexing—both on polygon bounding boxes and on individual edges—dramatically speeds up queries even for millions of complex polygons.
