TY - JOUR
T1 - How Good Are Modern Spatial Libraries?
AU - Pandey, Varun
AU - van Renen, Alexander
AU - Kipf, Andreas
AU - Kemper, Alfons
N1 - Publisher Copyright:
© 2020, The Author(s).
PY - 2021/6
Y1 - 2021/6
N2 - Many applications today like Uber, Yelp, Tinder, etc. rely on spatial data or locations from its users. These applications and services either build their own spatial data management systems or rely on existing solutions. JTS Topology Suite (JTS), its C++ port GEOS, Google S2, ESRI Geometry API, and Java Spatial Index (JSI) are some of the spatial processing libraries that these systems build upon. These applications and services depend on indexing capabilities available in these libraries for high-performance spatial query processing. In this work, we compare these libraries qualitatively and quantitatively based on four different spatial queries using two real world datasets. We also compare these libraries with an open-source implementation of the Vantage Point Tree—an index structure that has been well studied in image retrieval and nearest-neighbor search algorithms for high-dimensional data. We found that Vantage Point Trees are very competitive and even outperform the aforementioned libraries in two queries.
AB - Many applications today like Uber, Yelp, Tinder, etc. rely on spatial data or locations from its users. These applications and services either build their own spatial data management systems or rely on existing solutions. JTS Topology Suite (JTS), its C++ port GEOS, Google S2, ESRI Geometry API, and Java Spatial Index (JSI) are some of the spatial processing libraries that these systems build upon. These applications and services depend on indexing capabilities available in these libraries for high-performance spatial query processing. In this work, we compare these libraries qualitatively and quantitatively based on four different spatial queries using two real world datasets. We also compare these libraries with an open-source implementation of the Vantage Point Tree—an index structure that has been well studied in image retrieval and nearest-neighbor search algorithms for high-dimensional data. We found that Vantage Point Trees are very competitive and even outperform the aforementioned libraries in two queries.
KW - Spatial
KW - Spatial data management
KW - Spatial libraries
UR - http://www.scopus.com/inward/record.url?scp=85096370287&partnerID=8YFLogxK
U2 - 10.1007/s41019-020-00147-9
DO - 10.1007/s41019-020-00147-9
M3 - Article
AN - SCOPUS:85096370287
SN - 2364-1185
VL - 6
SP - 192
EP - 208
JO - Data Science and Engineering
JF - Data Science and Engineering
IS - 2
ER -