blevesearch / bleve / 20958633242

53%

Build Type

push

github

Committed by web-flow

Commit Message

MB-69881: Improved APIs and perf optimizations for vector search (#2270)

- Use a `bitset` to track eligible documents instead of a slice of `N
uint64s`, reducing memory usage from `8N bytes` to `N/8 bytes` per
segment (up to `64×` reduction) and improving cache locality.
- Pass an iterator over eligible documents that iterates the bitset
directly, allowing direct translation into a bitset of eligible vector
IDs in the storage layer and eliminating the need for a separate slice
intermediary.
- Fix garbage creation in the `UnadornedPostingsIterator`, which
previously allocated a temporary struct per Next() call to wrap a doc
number and satisfy the `Postings` interface; the iterator now returns a
single reusable struct (one-time allocation) consistent with the working
of the `PostingsIterator` in the storage-layer.
- Avoid unnecessary `BytesRead` statistics computation when executing
searches in no-scoring mode, removing redundant work as a
micro-optimization.

---------

Co-authored-by: Abhinav Dangeti <abhinav@couchbase.com>

Run Details

22 of 41 new or added lines in 9 files covered. (53.66%)

13 existing lines in 4 files now uncovered.

19095 of 35561 relevant lines covered (53.7%)

0.6 hits per line