New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Query performance explodes with more dimensions #2

Open

mck- opened this issue Sep 6, 2013 · 1 comment

Labels

Contributor

mck- commented Sep 6, 2013

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?

mck- added a commit that referenced this issue


#2 More dimensionality benchmarking

e9a6fca

mck- mentioned this issue

Stack overflow for large number of rows #1

Open

Contributor Author

mck- commented Sep 6, 2013

Some more benchmarking data, varying k:

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment