|
|
|
|
|
by mgaunard
130 days ago
|
|
Spatial indices simply partition your data in N-dimensional space the same way a binary tree does it in 1-dimensional space. The whole advantage over a static partition is that it will allow you to properly deal with data that is irregularly distributed. Those data structures can definitely be merged if that's what you're asking. |
|
About your binary tree comment: yes this is absolutely valid, but consider then that binary trees also are a bad fit for distributed computing, where data is often partitioned at the top level (making it no longer a binary tree but a set of binary trees) and cross-node joins are expensive.