Abstract We present a study to show the possibility of using two well-known space partitioning and indexing techniques, kd trees and quad trees, in declustering applications to increase input/output (I/O) parallelization and reduce spatial data processing times. This parallelization enables time-consuming computational geometry algorithms to be applied efficiently to big spatial data rendering and querying. The key challenge is how to balance the spatial processing load across a large number of worker nodes, given significant performance heterogeneity in nodes and processing skews in the workload.
Ahmet Sayar, Süleyman Eken, Okan ?ztürk. Kd-tree and quad-tree decompositions for declustering of 2D range queries over uncertain space. Front. Inform. Technol. Electron. Eng., 2015, 16(2): 98-108.