Look-Alike
Look-Alike copied to clipboard
Query performance explodes with more dimensions
Benchmarking shows that the amount of tree that needs to be traversed explodes exponentially with more dimensions...
Strange? Since depth of tree should stay the same in theory?
Some more benchmarking data, varying k
: