Spatial search using key-value store

Abstract

A spatial search may be performed using representations of geometric shapes stored in a key-value store. A request to perform a spatial search may be received, the request including a geometric shape composed of one or more points. The points of the geometrical shape may be translated into one or more spatial indexes representing spatial cells using a space-filling curve. A key-value store may then be incrementally searched for each spatial index to identify spatial cells intersecting the geometric shape for which other known geometric shapes exist. The key-value store may then be searched to identify the known geometric shapes intersecting the geometric shape included in the search.