A Comparison of Heuristics for Scheduling Spatial Clusters to Reduce I/O Cost in Spatial Join Processing

Efficient processing of spatial joins with DOT-based indexing

“…The refinement step produces the final result set from those candidate pairs using geometrical computations. The spatial join accesses all the spatial objects repeatedly, and so it requires a high cost in terms of disk access and CPU processing [4,13,37]. Therefore, spatial join algorithms should be devised with careful consideration of the characteristics of the underlying spatial index structures [34].…”