pith. sign in

arxiv: 1506.05158 · v1 · pith:G7B47IBOnew · submitted 2015-06-16 · 💻 cs.DB · cs.DC

An Entropy Maximizing Geohash for Distributed Spatiotemporal Database Indexing

classification 💻 cs.DB cs.DC
keywords datageohashspatialalgorithmcensusdistributedentropygiven
0
0 comments X
read the original abstract

We present a modification of the standard geohash algorithm based on maximum entropy encoding in which the data volume is approximately constant for a given hash prefix length. Distributed spatiotemporal databases, which typically require interleaving spatial and temporal elements into a single key, reap large benefits from a balanced geohash by creating a consistent ratio between spatial and temporal precision even across areas of varying data density. This property is also useful for indexing purely spatial datasets, where the load distribution of large range scans is an important aspect of query performance. We apply our algorithm to data generated proportional to population as given by census block population counts provided from the US Census Bureau.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.