Could this be used for/generalized for Nd spatial proximity lookup tables?
Yeah I was curious about using it for raytracing, maybe like a kd-tree where you consider one dimension per level.
PGM Indexes: Learned indexes that match B-tree performance with 83x less space
121–124 of 124 posts
Re: PGM Indexes: Learned indexes that match B-tree performance with 83x less space
#122This is interesting. Could this be adapted to store 2D data, like how a quadtree is a 2D range tree? (If you link me to a paper / pseudocode for that, I could implement it.) I imagine it would be useful in GIS, gaming, etc.
Hi @crazypython and thank you! Yep, I just added an implementation of the multidimensional PGM-index in the main repo. If you want to improve it, you are more than welcome. Drop me an email if you have some ideas. Thanks again!
Re: PGM Indexes: Learned indexes that match B-tree performance with 83x less space
#123Re: PGM Indexes: Learned indexes that match B-tree performance with 83x less space
#124Earlier quoted context omitted.
Yeah I was curious about using it for raytracing, maybe like a kd-tree where you consider one dimension per level.
Hi @magicalhippo and @midjji. Please, have a look at the main repo, I just uploaded an implementation of the multidimensional PGM-index supporting orthogonal range searches ;)