Geohashing: Encoding the location coordinates

In 2008, Gustavo Niemeyer invented a geocoding method where geographic coordinates (latitude and longitude) were encoded in short alphanumeric strings. The basic idea was first brought on by G.M. Morton in 1996. For a better understanding, let’s see an example,

The latitude and longitude of Kathmandu, Nepal are 27.717245 and 85.323959 respectively and we write the coordinates like (27.717245, 85.323959).

Now, if we represent them in geohash, it becomes short and easy to remember,

Now, if we represent them in geohash, it becomes short and easy to remember,

Tuutttg08kgn

You can easily see geohashing used in some of the databases like MySQL, Redis, Amazon DynamoDB, and Google Cloud Firestore.

How does Geohashing work?

Geohashing works as a hierarchical spatial index that uses a Base-32 alphabet encoding system. There are 32 cells, and each cell further contains 32 individual cells. The first character in the encoded geohash identifies an initial location that can be understood by thinking of the place as a point. The world is divided into smaller and smaller cells repeatedly until the location is precise. The size of the cell also determines the precision of the location. The points or the location are closer if the prefix matches. The longer the match of the prefix, the closer the location.

For example, Tuutttg08kgn and Tuutttg08kfg are very close since they share the same prefix Tuutttg08k.

In addition, the larger the characters in the string (maximum 12), the more precise the location. This means that we also have anonymity with the use of geohash since only the area is represented in the encoded alphanumeric string.

Cell Sizes for Geohashing

Geohash	Cell Height	Cell Width
1	5000 km	5000 km
2	1250 km	1250 km
3	156 km	156 km
4	19.5 km	39.1 km
5	4.89 km	4.89 km
6	0.61 km	1.22 km
7	153 m	153 m
8	19.1 m	38.2 m
9	4.77 m	4.77 m
10	0.596 m	1.19 m
11	149 mm	149 mm
12	18.6 mm	37.2 mm

Use Cases

Let’s see some of the use cases of geo hashing.

• Storing and representing a location in a database is easy and simple.
• Sharing and remembering is easy since it is less complicated than latitude and longitude. It can be represented as a URL.
• We can find out nearby points with string comparison which is very efficient in case we have large indexes.

pragyaasapkota / System-Design-Concepts

Though the concepts of system design might be tricky, let's see them individually to their core concepts and have a better understanding.

System Design

Systems design is the process of defining elements of a system like modules, architecture, components and their interfaces and data for a system based on the specified requirements.

This is a index for the concepts of system.

If you wish to open these in a new tab, Press CTRL+click

S.N.	Table of Content
1.	Caching
2.	Network Protocols
3.	Storage: The Underrated Topic
4.	Latency and Throughput
5.	System Availability
6.	Leader Election
7.	Proxies
8.	Load Balancing
9.	Endpoint Protection
10.	HTTPS: Is it better than HTTP?
11.	Polling and Streaming
12.	Long Polling
13.	Hashing
14.	CAP Theorem
15.	PACELC Theorem
16.	Messaging and Pub-Sub
17.	Database Relational Database Non-relational Database
18.	Logging, Monitoring, and Alerting
19.	Distributed System
20.	Scaling
21.	Event Driven Architecture (EDA)
22.	CQRS
23.	Message Queue
24.	Architectural Patterns
25.	Enterprise Service Bus (ESB)
26.	SLA, SLO, and SLI
27.	Heartbeat

…

View on GitHub

I hope this article was helpful to you.

Please don’t forget to follow me!!!

Any kind of feedback or comment is welcome!!!

Thank you for your time and support!!!!

Keep Reading!! Keep Learning!!!