Connected mobility applications rely heavily on geospatial joins that associate point data, such as locations of Uber cars, to static polygonal regions, such as city neighborhoods. These joins typically involve expensive geometric computations, which makes it hard to provide an interactive user experience. In this paper, we propose an adaptive polygon index that leverages true hit fltering to avoid expensive geometric computations in most cases. In particular, our approach closely approximates polygons by combining quadtrees with true hit filtering, and stores these approximations in a query-effcient radix tree. Based on this index, we introduce two geospatial join algorithms: an approximate one that guarantees a user-defined precision, and an exact one that adapts to the expected point distribution. In summary, our technique outperforms existing CPU-based joins by up to two orders of magnitude and is competitive with state-of-the-art GPU implementations.

Additional Metadata
Persistent URL dx.doi.org/10.5441/002/edbt.2020.31
Conference International Conference on Extending Database Technology
Citation
Kipf, A, Lang, H, Pandey, V.N, Persa, R.A, Anneser, C, Zacharatou, E.T, … Kemper, A. (2020). Adaptive main-memory indexing for high-performance point-polygon joins. In Advances in Database Technology - EDBT (pp. 347–358). doi:10.5441/002/edbt.2020.31