Spatial Indexing - ProkopHapala/FireCore GitHub Wiki
The PH-Tree – A Space-Efficient Storage Structure and Multi-Dimensional Index
We have presented the PH-tree as an approach for com- bined storage and indexing of multi-dimensional data. The tests showed that the PH-tree is space efficient, requiring significantly less space than structures such as the kD-tree and in certain cases even less space than naive plain array storage. As a multi-dimensional index structure, it showed competitive performance for updates and queries, especially for larger datasets.