How do QuadTrees (or Geohashes) allow efficient 'Find nearby restaurants' queries in a standard Key-Value store?

1. A They perform an exhaustive, brute-force Euclidean distance calculation on every single coordinate stored in the database to ensure 100% mathematical precision.
2. B They utilize specialized 128-bit floating point indexes that are natively optimized by the storage engine to handle multi-dimensional geometric calculations in real-time.
3. C They linearize 2D space into a 1D string where physically close points share long common prefixes, allowing for efficient range-scans via standard B-Tree indexes.
4. D They convert every coordinate into a high-resolution binary image (bitmap) that is then processed by the database's internal computer-vision layer for proximity detection.