Geospatial data (R-tree)

RaimaDB supports an index algorithm designed specifically for geospatial data called an R-Tree. It is a balanced search tree that organizes its data into pages and is designed to group physically nearby objects and then represent that in the next level of the tree. This is the ideal index type when the users need quick retrieval of multi-dimensional data within a bounding box. A common use case for an R-tree might be to store spatial objects such as restaurant locations or the polygons that typical maps are made of: streets, buildings, outlines of lakes, coastlines, etc.