3 ms·
Also the distance metric for r*-trees is just plain wacky for anything other than low-dimensional Euclidean space. Even if you could make it perform well, it w
by KirillPanov 3y ago
Also the distance metric for r*-trees is just plain wacky for anything other than low-dimensional Euclidean space.
Even if you could make it perform well, it would not do what you want.
- modulovalue 3y agoAre you saying this because r-trees expect a proper metric space, and people have the need to index datasets over non-metric spaces?
- pornel 3y agoThe curse of dimensionality creates a seemingly paradoxical situation where you have a vast vast search space, but everything is incredibly close to each other. Space subdivision algorithms become ineffective.