Skip to content
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.

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

Fragment cache #94

Merged
merged 7 commits into from
Sep 25, 2023
Merged

Fragment cache #94

merged 7 commits into from
Sep 25, 2023

Conversation

jbellis
Copy link
Owner

@jbellis jbellis commented Sep 22, 2023

No description provided.

@jbellis jbellis requested a review from jkni September 22, 2023 17:50
@jbellis jbellis self-assigned this Sep 22, 2023
@jbellis
Copy link
Owner Author

jbellis commented Sep 22, 2023

I'm not worrying about the case where the graph is too small to benefit from caching, b/c C* already tries to detect tiny graphs and do a brute force comparison anyway. Can revisit later if necessary.

case EUCLIDEAN:
cache[i][j] = VectorUtil.squareDistance(centroidSubvector, 0, centeredQuery, offset, centroidSubvector.length);
break;
default:
Copy link
Collaborator

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

cosine too expensive to be worth precomputing?

@jkni jkni self-requested a review September 25, 2023 14:53
@jbellis jbellis merged commit 6873e1f into main Sep 25, 2023
8 checks passed
@jbellis jbellis deleted the fragment-cache branch November 6, 2023 14:05
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

None yet

2 participants