Table 2 Run time of spatial partitioning algorithms
From: Comparison of LSM indexing techniques for storing spatial data
| Â | Size | STR | R*-Grove |
|---|---|---|---|
Hilbert | \(\mathcal {O}(n)\) | \(\mathcal {O}(n \log n)\) | \(\mathcal {O}(n \log ^2 n)\) |
Simple | \(\mathcal {O}(n)\) | \(\mathcal {O}(n)\) | \(\mathcal {O}(n \log ^2 n)\) |