When spatial data is pre-indexed with any of four DGGS, point-in-polygon reduces to sub-second relational hash-joins in DuckDB, eliminating geometric predicate cost and the tooling gap.
2024), 105922
1 Pith paper cite this work, alongside 4 external citations. Polarity classification is still indexing.
1
Pith paper citing it
4
external citations · external index
fields
cs.DB 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Accelerating Point-in-Polygon Predicates via Algebraic Hash-Joins and Discrete Global Grids at Scale
When spatial data is pre-indexed with any of four DGGS, point-in-polygon reduces to sub-second relational hash-joins in DuckDB, eliminating geometric predicate cost and the tooling gap.