Skip to content

Improve index_gt::search_for_one_ by avoiding entry-node locks for immutable index #689

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

Merged
ashvardanian merged 2 commits into from
Dec 21, 2025
Merged

Improve index_gt::search_for_one_ by avoiding entry-node locks for immutable index #689

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
3d10a6c
Perf: Improve index_gt::search_for_one_ by avoiding entry-node locks …
yoonseok-kim Dec 12, 2025
884c2a3
Improve: Code style consistency
ashvardanian Dec 21, 2025
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
3 changes: 2 additions & 1 deletion include/usearch/index.hpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -3999,12 +3999,13 @@ class index_gt {
if (!is_dummy<prefetch_at>())
prefetch(citerator_at(closest_slot), citerator_at(closest_slot) + 1);

bool const need_lock = !is_immutable();
distance_t closest_dist = context.measure(query, citerator_at(closest_slot), metric);
for (level_t level = begin_level; level > end_level; --level) {
bool changed;
do {
changed = false;
node_lock_t closest_lock = node_lock_(closest_slot);
optional_node_lock_t closest_lock = optional_node_lock_(closest_slot, need_lock);
neighbors_ref_t closest_neighbors = neighbors_non_base_(node_at_(closest_slot), level);

// Optional prefetching
Expand Down