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

Do not assume node is out of bounds in deserializer #3044

Merged
merged 1 commit into from May 24, 2023
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Jump to
Jump to file
Failed to load files.
Diff view
Diff view
30 changes: 21 additions & 9 deletions adapters/repos/db/vector/hnsw/deserializer.go
Expand Up @@ -353,9 +353,13 @@ func (d *Deserializer) ReadClearLinks(r io.Reader, res *DeserializationResult,
return err
}

if int(id) >= len(res.Nodes) {
// node is out of bounds, so it can't exist, nothing to do here
return nil
newNodes, changed, err := growIndexToAccomodateNode(res.Nodes, id, d.logger)
if err != nil {
return err
}

if changed {
res.Nodes = newNodes
}

if res.Nodes[id] == nil {
Expand All @@ -380,9 +384,13 @@ func (d *Deserializer) ReadClearLinksAtLevel(r io.Reader, res *DeserializationRe
return err
}

if int(id) >= len(res.Nodes) {
// node is out of bounds, so it can't exist, nothing to do here
return nil
newNodes, changed, err := growIndexToAccomodateNode(res.Nodes, id, d.logger)
if err != nil {
return err
}

if changed {
res.Nodes = newNodes
}

if keepReplaceInfo {
Expand Down Expand Up @@ -439,9 +447,13 @@ func (d *Deserializer) ReadDeleteNode(r io.Reader, res *DeserializationResult) e
return err
}

if int(id) >= len(res.Nodes) {
// node is out of bounds, so it can't exist, nothing to do here
return nil
newNodes, changed, err := growIndexToAccomodateNode(res.Nodes, id, d.logger)
if err != nil {
return err
}

if changed {
res.Nodes = newNodes
}

res.Nodes[id] = nil
Expand Down
Expand Up @@ -142,6 +142,57 @@ func Test_NoRace_ManySmallCommitlogs(t *testing.T) {
}
})

t.Run("delete 10 percent of data", func(t *testing.T) {
type tuple struct {
vec []float32
id uint64
}

jobs := make(chan tuple, n)

wg := sync.WaitGroup{}
worker := func(jobs chan tuple) {
for job := range jobs {
index.Delete(job.id)
}

wg.Done()
}

for i := 0; i < runtime.GOMAXPROCS(0); i++ {
wg.Add(1)
go worker(jobs)
}

for i, vec := range data[:n/10] {
jobs <- tuple{id: uint64(i), vec: vec}
}

close(jobs)

wg.Wait()
})

index.Flush()

t.Run("verify there are no nodes with too many links - post deletion", func(t *testing.T) {
for i, node := range index.nodes {
if node == nil {
continue
}

for level, conns := range node.connections {
m := index.maximumConnections
if level == 0 {
m = index.maximumConnectionsLayerZero
}

assert.LessOrEqualf(t, len(conns), m, "node %d at level %d with %d conns",
i, level, len(conns))
}
}
})

t.Run("destroy the old index", func(t *testing.T) {
// kill the commit loger and index
require.Nil(t, original.Shutdown(context.Background()))
Expand Down