Skip to content

perf(hnsw): optimize backlink addition, ranking and pruning #104

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

Draft
pranav7002 wants to merge 1 commit into
base: main
Choose a base branch
from
Draft

perf(hnsw): optimize backlink addition, ranking and pruning #104

Changes from all commits
Commits
Show all changes
1 commit
Select commit
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
14 changes: 14 additions & 0 deletions crates/index/src/hnsw/search.rs
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -197,6 +197,20 @@ impl HnswIndex {
if n == p {
continue;
}

self.ensure_level(n, level);
let node = self.index.nodes.get_mut(&n).unwrap();
let list = &mut node.neighbors[level];

// The list has room: just add p, no need to compute distances or sort
if list.len() < m {
if !list.contains(&p) {
list.push(p);
}
continue;
}

// The list is full: keep only the closest m
self.merge_and_prune(n, level, &[p], m)?;
}
Ok(())
Expand Down
Loading