Add vector search benchmarks to benchmarking suite#7399
Draft
connortsui20 wants to merge 3 commits intodevelopfrom
Draft
Add vector search benchmarks to benchmarking suite#7399connortsui20 wants to merge 3 commits intodevelopfrom
connortsui20 wants to merge 3 commits intodevelopfrom
Conversation
This was referenced Apr 11, 2026
35495f0 to
34a10c6
Compare
Co-authored-by: Claude <noreply@anthropic.com> Signed-off-by: Connor Tsui <connor.tsui20@gmail.com>
Signed-off-by: Connor Tsui <connor.tsui20@gmail.com>
34a10c6 to
6cbb199
Compare
Signed-off-by: Connor Tsui <connor.tsui20@gmail.com>
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Summary
Tracking issue: #7297
Adds a
vector-search-benchcrate similar to VectorDBBench.The benchmark brute-forces cosine similarity search over public VectorDBBench datasets (Cohere, OpenAI, etc).
Since Vortex is not a database, we do not measure things like vector inserts and deletes. instead we just measure storage size and throughput for four targets:
&[f32]Every variant goes through a correctness check against the uncompressed scan before timing.
Not sure if this makes sense to have on a PR benchmark yet since this can only happen on a very specific array tree that will have a very specific optimized implementation.
Testing
N/A