top | item 46922524 (no title) mgaunard | 23 days ago Why doesn't it use k-d trees or r-trees? discuss order hn newest cpa|22 days ago The big reason is that H3 is data independant. You put your data in predefined bins and then join on them, whereas kd/r trees depend on the data and building the trees may become prohibitive or very hard (especially in distributed systems). mgaunard|22 days ago Indices are meant to depend on the data yes, not exactly rocket science.Updating an R-tree is log(n) just like any other index. load replies (3)
cpa|22 days ago The big reason is that H3 is data independant. You put your data in predefined bins and then join on them, whereas kd/r trees depend on the data and building the trees may become prohibitive or very hard (especially in distributed systems). mgaunard|22 days ago Indices are meant to depend on the data yes, not exactly rocket science.Updating an R-tree is log(n) just like any other index. load replies (3)
mgaunard|22 days ago Indices are meant to depend on the data yes, not exactly rocket science.Updating an R-tree is log(n) just like any other index. load replies (3)
cpa|22 days ago
mgaunard|22 days ago
Updating an R-tree is log(n) just like any other index.