-
Notifications
You must be signed in to change notification settings - Fork 681
/
index.go
728 lines (606 loc) · 20.7 KB
/
index.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
// _ _
// __ _____ __ ___ ___ __ _| |_ ___
// \ \ /\ / / _ \/ _` \ \ / / |/ _` | __/ _ \
// \ V V / __/ (_| |\ V /| | (_| | || __/
// \_/\_/ \___|\__,_| \_/ |_|\__,_|\__\___|
//
// Copyright © 2016 - 2024 Weaviate B.V. All rights reserved.
//
// CONTACT: hello@weaviate.io
//
package hnsw
import (
"context"
"fmt"
"io"
"math"
"math/rand"
"strings"
"sync"
"sync/atomic"
"github.com/pkg/errors"
"github.com/sirupsen/logrus"
"github.com/weaviate/weaviate/adapters/repos/db/lsmkv"
"github.com/weaviate/weaviate/adapters/repos/db/priorityqueue"
"github.com/weaviate/weaviate/adapters/repos/db/vector/cache"
"github.com/weaviate/weaviate/adapters/repos/db/vector/common"
"github.com/weaviate/weaviate/adapters/repos/db/vector/compressionhelpers"
"github.com/weaviate/weaviate/adapters/repos/db/vector/hnsw/distancer"
"github.com/weaviate/weaviate/entities/cyclemanager"
"github.com/weaviate/weaviate/entities/schema/config"
"github.com/weaviate/weaviate/entities/storobj"
ent "github.com/weaviate/weaviate/entities/vectorindex/hnsw"
"github.com/weaviate/weaviate/usecases/memwatch"
)
type hnsw struct {
// global lock to prevent concurrent map read/write, etc.
sync.RWMutex
// certain operations related to deleting, such as finding a new entrypoint
// can only run sequentially, this separate lock helps assuring this without
// blocking the general usage of the hnsw index
deleteLock *sync.Mutex
tombstoneLock *sync.RWMutex
// prevents tombstones cleanup to be performed in parallel with index reset operation
resetLock *sync.Mutex
// indicates whether reset operation occurred or not - if so tombstones cleanup method
// is aborted as it makes no sense anymore
resetCtx context.Context
resetCtxCancel context.CancelFunc
// indicates the index is shutting down
shutdownCtx context.Context
shutdownCtxCancel context.CancelFunc
// make sure the very first insert happens just once, otherwise we
// accidentally overwrite previous entrypoints on parallel imports on an
// empty graph
initialInsertOnce *sync.Once
// Each node should not have more edges than this number
maximumConnections int
// Nodes in the lowest level have a separate (usually higher) max connection
// limit
maximumConnectionsLayerZero int
// the current maximum can be smaller than the configured maximum because of
// the exponentially decaying layer function. The initial entry is started at
// layer 0, but this has the chance to grow with every subsequent entry
currentMaximumLayer int
// this is a point on the highest level, if we insert a new point with a
// higher level it will become the new entry point. Note tat the level of
// this point is always currentMaximumLayer
entryPointID uint64
// ef parameter used in construction phases, should be higher than ef during querying
efConstruction int
// ef at search time
ef int64
// only used if ef=-1
efMin int64
efMax int64
efFactor int64
// on filtered searches with less than n elements, perform flat search
flatSearchCutoff int64
levelNormalizer float64
nodes []*vertex
vectorForID common.VectorForID[float32]
TempVectorForIDThunk common.TempVectorForID
multiVectorForID common.MultiVectorForID
trackDimensionsOnce sync.Once
dims int32
cache cache.Cache[float32]
commitLog CommitLogger
// a lookup of current tombstones (i.e. nodes that have received a tombstone,
// but have not been cleaned up yet) Cleanup is the process of removal of all
// outgoing edges to the tombstone as well as deleting the tombstone itself.
// This process should happen periodically.
tombstones map[uint64]struct{}
tombstoneCleanupCallbackCtrl cyclemanager.CycleCallbackCtrl
shardCompactionCallbacks cyclemanager.CycleCallbackGroup
shardFlushCallbacks cyclemanager.CycleCallbackGroup
// // for distributed spike, can be used to call a insertExternal on a different graph
// insertHook func(node, targetLevel int, neighborsAtLevel map[int][]uint32)
id string
rootPath string
logger logrus.FieldLogger
distancerProvider distancer.Provider
pools *pools
forbidFlat bool // mostly used in testing scenarios where we want to use the index even in scenarios where we typically wouldn't
metrics *Metrics
insertMetrics *insertMetrics
randFunc func() float64 // added to temporarily get rid on flakiness in tombstones related tests. to be removed after fixing WEAVIATE-179
// The deleteVsInsertLock makes sure that there are no concurrent delete and
// insert operations happening. It uses an RW-Mutex with:
//
// RLock -> Insert operations, this means any number of import operations can
// happen concurrently.
//
// Lock -> Delete operation. This means only a single delete operation can
// occur at a time, no insert operation can occur simultaneously with a
// delete. Since the delete is cheap (just marking the node as deleted), the
// single-threadedness of deletes is not a big problem.
//
// This lock was introduced as part of
// https://github.com/weaviate/weaviate/issues/2194
//
// See
// https://github.com/weaviate/weaviate/pull/2191#issuecomment-1242726787
// where we ran performance tests to make sure introducing this lock has no
// negative impact on performance.
deleteVsInsertLock sync.RWMutex
compressed atomic.Bool
doNotRescore bool
compressor compressionhelpers.VectorCompressor
pqConfig ent.PQConfig
compressActionLock *sync.RWMutex
className string
shardName string
VectorForIDThunk common.VectorForID[float32]
shardedNodeLocks *common.ShardedRWLocks
store *lsmkv.Store
allocChecker memwatch.AllocChecker
}
type CommitLogger interface {
ID() string
AddNode(node *vertex) error
SetEntryPointWithMaxLayer(id uint64, level int) error
AddLinkAtLevel(nodeid uint64, level int, target uint64) error
ReplaceLinksAtLevel(nodeid uint64, level int, targets []uint64) error
AddTombstone(nodeid uint64) error
RemoveTombstone(nodeid uint64) error
DeleteNode(nodeid uint64) error
ClearLinks(nodeid uint64) error
ClearLinksAtLevel(nodeid uint64, level uint16) error
Reset() error
Drop(ctx context.Context) error
Flush() error
Shutdown(ctx context.Context) error
RootPath() string
SwitchCommitLogs(bool) error
AddPQ(compressionhelpers.PQData) error
}
type BufferedLinksLogger interface {
AddLinkAtLevel(nodeid uint64, level int, target uint64) error
ReplaceLinksAtLevel(nodeid uint64, level int, targets []uint64) error
Close() error // Close should Flush and Close
}
type MakeCommitLogger func() (CommitLogger, error)
// New creates a new HNSW index, the commit logger is provided through a thunk
// (a function which can be deferred). This is because creating a commit logger
// opens files for writing. However, checking whether a file is present, is a
// criterium for the index to see if it has to recover from disk or if its a
// truly new index. So instead the index is initialized, with un-biased disk
// checks first and only then is the commit logger created
func New(cfg Config, uc ent.UserConfig, tombstoneCallbacks, shardCompactionCallbacks,
shardFlushCallbacks cyclemanager.CycleCallbackGroup, store *lsmkv.Store,
) (*hnsw, error) {
if err := cfg.Validate(); err != nil {
return nil, errors.Wrap(err, "invalid config")
}
if cfg.Logger == nil {
logger := logrus.New()
logger.Out = io.Discard
cfg.Logger = logger
}
normalizeOnRead := false
if cfg.DistanceProvider.Type() == "cosine-dot" {
normalizeOnRead = true
}
vectorCache := cache.NewShardedFloat32LockCache(cfg.VectorForIDThunk, uc.VectorCacheMaxObjects,
cfg.Logger, normalizeOnRead, cache.DefaultDeletionInterval, cfg.AllocChecker)
resetCtx, resetCtxCancel := context.WithCancel(context.Background())
shutdownCtx, shutdownCtxCancel := context.WithCancel(context.Background())
index := &hnsw{
maximumConnections: uc.MaxConnections,
// inspired by original paper and other implementations
maximumConnectionsLayerZero: 2 * uc.MaxConnections,
// inspired by c++ implementation
levelNormalizer: 1 / math.Log(float64(uc.MaxConnections)),
efConstruction: uc.EFConstruction,
flatSearchCutoff: int64(uc.FlatSearchCutoff),
nodes: make([]*vertex, cache.InitialSize),
cache: vectorCache,
vectorForID: vectorCache.Get,
multiVectorForID: vectorCache.MultiGet,
id: cfg.ID,
rootPath: cfg.RootPath,
tombstones: map[uint64]struct{}{},
logger: cfg.Logger,
distancerProvider: cfg.DistanceProvider,
deleteLock: &sync.Mutex{},
tombstoneLock: &sync.RWMutex{},
resetLock: &sync.Mutex{},
resetCtx: resetCtx,
resetCtxCancel: resetCtxCancel,
shutdownCtx: shutdownCtx,
shutdownCtxCancel: shutdownCtxCancel,
initialInsertOnce: &sync.Once{},
ef: int64(uc.EF),
efMin: int64(uc.DynamicEFMin),
efMax: int64(uc.DynamicEFMax),
efFactor: int64(uc.DynamicEFFactor),
metrics: NewMetrics(cfg.PrometheusMetrics, cfg.ClassName, cfg.ShardName),
shardName: cfg.ShardName,
randFunc: rand.Float64,
compressActionLock: &sync.RWMutex{},
className: cfg.ClassName,
VectorForIDThunk: cfg.VectorForIDThunk,
TempVectorForIDThunk: cfg.TempVectorForIDThunk,
pqConfig: uc.PQ,
shardedNodeLocks: common.NewDefaultShardedRWLocks(),
shardCompactionCallbacks: shardCompactionCallbacks,
shardFlushCallbacks: shardFlushCallbacks,
store: store,
allocChecker: cfg.AllocChecker,
}
if uc.BQ.Enabled {
var err error
index.compressor, err = compressionhelpers.NewBQCompressor(
index.distancerProvider, uc.VectorCacheMaxObjects, cfg.Logger, store,
cfg.AllocChecker)
if err != nil {
return nil, err
}
index.compressed.Store(true)
index.cache.Drop()
index.cache = nil
}
if err := index.init(cfg); err != nil {
return nil, errors.Wrapf(err, "init index %q", index.id)
}
// TODO common_cycle_manager move to poststartup?
id := strings.Join([]string{
"hnsw", "tombstone_cleanup",
index.className, index.shardName, index.id,
}, "/")
index.tombstoneCleanupCallbackCtrl = tombstoneCallbacks.Register(id, index.tombstoneCleanup)
index.insertMetrics = newInsertMetrics(index.metrics)
return index, nil
}
// TODO: use this for incoming replication
// func (h *hnsw) insertFromExternal(nodeId, targetLevel int, neighborsAtLevel map[int][]uint32) {
// defer m.addBuildingReplication(time.Now())
// // randomly introduce up to 50ms delay to account for network slowness
// time.Sleep(time.Duration(rand.Intn(500)) * time.Millisecond)
// var node *hnswVertex
// h.RLock()
// total := len(h.nodes)
// if total > nodeId {
// node = h.nodes[nodeId] // it could be that we implicitly added this node already because it was referenced
// }
// h.RUnlock()
// if node == nil {
// node = &hnswVertex{
// id: nodeId,
// connections: make(map[int][]uint32),
// level: targetLevel,
// }
// } else {
// node.level = targetLevel
// }
// if total == 0 {
// h.Lock()
// h.commitLog.SetEntryPointWithMaxLayer(node.id, 0)
// h.entryPointID = node.id
// h.currentMaximumLayer = 0
// node.connections = map[int][]uint32{}
// node.level = 0
// // h.nodes = make([]*hnswVertex, 100000)
// h.commitLog.AddNode(node)
// h.nodes[node.id] = node
// h.Unlock()
// return
// }
// currentMaximumLayer := h.currentMaximumLayer
// h.Lock()
// h.nodes[nodeId] = node
// h.commitLog.AddNode(node)
// h.Unlock()
// for level := min(targetLevel, currentMaximumLayer); level >= 0; level-- {
// neighbors := neighborsAtLevel[level]
// for _, neighborID := range neighbors {
// h.RLock()
// neighbor := h.nodes[neighborID]
// if neighbor == nil {
// // due to everything being parallel it could be that the linked neighbor
// // doesn't exist yet
// h.nodes[neighborID] = &hnswVertex{
// id: int(neighborID),
// connections: make(map[int][]uint32),
// }
// neighbor = h.nodes[neighborID]
// }
// h.RUnlock()
// neighbor.linkAtLevel(level, uint32(nodeId), h.commitLog)
// node.linkAtLevel(level, uint32(neighbor.id), h.commitLog)
// neighbor.RLock()
// currentConnections := neighbor.connections[level]
// neighbor.RUnlock()
// maximumConnections := h.maximumConnections
// if level == 0 {
// maximumConnections = h.maximumConnectionsLayerZero
// }
// if len(currentConnections) <= maximumConnections {
// // nothing to do, skip
// continue
// }
// // TODO: support both neighbor selection algos
// updatedConnections := h.selectNeighborsSimpleFromId(nodeId, currentConnections, maximumConnections)
// neighbor.Lock()
// h.commitLog.ReplaceLinksAtLevel(neighbor.id, level, updatedConnections)
// neighbor.connections[level] = updatedConnections
// neighbor.Unlock()
// }
// }
// if targetLevel > h.currentMaximumLayer {
// h.Lock()
// h.commitLog.SetEntryPointWithMaxLayer(nodeId, targetLevel)
// h.entryPointID = nodeId
// h.currentMaximumLayer = targetLevel
// h.Unlock()
// }
// }
func (h *hnsw) findBestEntrypointForNode(currentMaxLevel, targetLevel int,
entryPointID uint64, nodeVec []float32, distancer compressionhelpers.CompressorDistancer,
) (uint64, error) {
// in case the new target is lower than the current max, we need to search
// each layer for a better candidate and update the candidate
for level := currentMaxLevel; level > targetLevel; level-- {
eps := priorityqueue.NewMin[any](1)
var dist float32
var ok bool
var err error
if h.compressed.Load() {
dist, ok, err = distancer.DistanceToNode(entryPointID)
var e storobj.ErrNotFound
if errors.As(err, &e) {
h.handleDeletedNode(e.DocID)
continue
}
} else {
dist, ok, err = h.distBetweenNodeAndVec(entryPointID, nodeVec)
}
if err != nil {
return 0, errors.Wrapf(err,
"calculate distance between insert node and entry point at level %d", level)
}
if !ok {
continue
}
eps.Insert(entryPointID, dist)
res, err := h.searchLayerByVectorWithDistancer(nodeVec, eps, 1, level, nil, distancer)
if err != nil {
return 0,
errors.Wrapf(err, "update candidate: search layer at level %d", level)
}
if res.Len() > 0 {
// if we could find a new entrypoint, use it
// in case everything was tombstoned, stick with the existing one
elem := res.Pop()
n := h.nodeByID(elem.ID)
if n != nil && !n.isUnderMaintenance() {
// but not if the entrypoint is under maintenance
entryPointID = elem.ID
}
}
h.pools.pqResults.Put(res)
}
return entryPointID, nil
}
func min(a, b int) int {
if a < b {
return a
}
return b
}
func (h *hnsw) distBetweenNodes(a, b uint64) (float32, bool, error) {
if h.compressed.Load() {
dist, err := h.compressor.DistanceBetweenCompressedVectorsFromIDs(context.Background(), a, b)
if err != nil {
var e storobj.ErrNotFound
if errors.As(err, &e) {
h.handleDeletedNode(e.DocID)
return 0, false, nil
} else {
return 0, false, err
}
}
return dist, true, nil
}
// TODO: introduce single search/transaction context instead of spawning new
// ones
vecA, err := h.vectorForID(context.Background(), a)
if err != nil {
var e storobj.ErrNotFound
if errors.As(err, &e) {
h.handleDeletedNode(e.DocID)
return 0, false, nil
} else {
// not a typed error, we can recover from, return with err
return 0, false, errors.Wrapf(err,
"could not get vector of object at docID %d", a)
}
}
if len(vecA) == 0 {
return 0, false, fmt.Errorf("got a nil or zero-length vector at docID %d", a)
}
vecB, err := h.vectorForID(context.Background(), b)
if err != nil {
var e storobj.ErrNotFound
if errors.As(err, &e) {
h.handleDeletedNode(e.DocID)
return 0, false, nil
} else {
// not a typed error, we can recover from, return with err
return 0, false, errors.Wrapf(err,
"could not get vector of object at docID %d", b)
}
}
if len(vecB) == 0 {
return 0, false, fmt.Errorf("got a nil or zero-length vector at docID %d", b)
}
return h.distancerProvider.SingleDist(vecA, vecB)
}
func (h *hnsw) distBetweenNodeAndVec(node uint64, vecB []float32) (float32, bool, error) {
if h.compressed.Load() {
dist, err := h.compressor.DistanceBetweenCompressedAndUncompressedVectorsFromID(context.Background(), node, vecB)
if err != nil {
var e storobj.ErrNotFound
if errors.As(err, &e) {
h.handleDeletedNode(e.DocID)
return 0, false, nil
} else {
return 0, false, err
}
}
return dist, true, nil
}
// TODO: introduce single search/transaction context instead of spawning new
// ones
vecA, err := h.vectorForID(context.Background(), node)
if err != nil {
var e storobj.ErrNotFound
if errors.As(err, &e) {
h.handleDeletedNode(e.DocID)
return 0, false, nil
} else {
// not a typed error, we can recover from, return with err
return 0, false, errors.Wrapf(err,
"could not get vector of object at docID %d", node)
}
}
if len(vecA) == 0 {
return 0, false, fmt.Errorf(
"got a nil or zero-length vector at docID %d", node)
}
if len(vecB) == 0 {
return 0, false, fmt.Errorf(
"got a nil or zero-length vector as search vector")
}
return h.distancerProvider.SingleDist(vecA, vecB)
}
func (h *hnsw) Stats() {
fmt.Printf("levels: %d\n", h.currentMaximumLayer)
perLevelCount := map[int]uint{}
for _, node := range h.nodes {
if node == nil {
continue
}
l := node.level
if l == 0 && len(node.connections) == 0 {
// filter out allocated space without nodes
continue
}
c, ok := perLevelCount[l]
if !ok {
perLevelCount[l] = 0
}
perLevelCount[l] = c + 1
}
for level, count := range perLevelCount {
fmt.Printf("unique count on level %d: %d\n", level, count)
}
}
func (h *hnsw) isEmpty() bool {
h.RLock()
defer h.RUnlock()
h.shardedNodeLocks.RLock(h.entryPointID)
defer h.shardedNodeLocks.RUnlock(h.entryPointID)
return h.isEmptyUnlocked()
}
func (h *hnsw) isEmptyUnlocked() bool {
return h.nodes[h.entryPointID] == nil
}
func (h *hnsw) nodeByID(id uint64) *vertex {
h.RLock()
defer h.RUnlock()
if id >= uint64(len(h.nodes)) {
// See https://github.com/weaviate/weaviate/issues/1838 for details.
// This could be after a crash recovery when the object store is "further
// ahead" than the hnsw index and we receive a delete request
return nil
}
h.shardedNodeLocks.RLock(id)
defer h.shardedNodeLocks.RUnlock(id)
return h.nodes[id]
}
func (h *hnsw) Drop(ctx context.Context) error {
// cancel tombstone cleanup goroutine
if err := h.tombstoneCleanupCallbackCtrl.Unregister(ctx); err != nil {
return errors.Wrap(err, "hnsw drop")
}
if h.compressed.Load() {
err := h.compressor.Drop()
if err != nil {
return fmt.Errorf("failed to shutdown compressed store")
}
} else {
// cancel vector cache goroutine
h.cache.Drop()
}
// cancel commit logger last, as the tombstone cleanup cycle might still
// write while it's still running
err := h.commitLog.Drop(ctx)
if err != nil {
return errors.Wrap(err, "commit log drop")
}
return nil
}
func (h *hnsw) Shutdown(ctx context.Context) error {
h.shutdownCtxCancel()
if err := h.commitLog.Shutdown(ctx); err != nil {
return errors.Wrap(err, "hnsw shutdown")
}
if err := h.tombstoneCleanupCallbackCtrl.Unregister(ctx); err != nil {
return errors.Wrap(err, "hnsw shutdown")
}
if h.compressed.Load() {
err := h.compressor.Drop()
if err != nil {
return errors.Wrap(err, "hnsw shutdown")
}
} else {
h.cache.Drop()
}
return nil
}
func (h *hnsw) Flush() error {
return h.commitLog.Flush()
}
func (h *hnsw) Entrypoint() uint64 {
h.RLock()
defer h.RUnlock()
return h.entryPointID
}
func (h *hnsw) DistanceBetweenVectors(x, y []float32) (float32, bool, error) {
return h.distancerProvider.SingleDist(x, y)
}
func (h *hnsw) ContainsNode(id uint64) bool {
h.RLock()
defer h.RUnlock()
h.shardedNodeLocks.RLock(id)
defer h.shardedNodeLocks.RUnlock(id)
return len(h.nodes) > int(id) && h.nodes[id] != nil
}
func (h *hnsw) DistancerProvider() distancer.Provider {
return h.distancerProvider
}
func (h *hnsw) ShouldUpgrade() (bool, int) {
return h.pqConfig.Enabled, h.pqConfig.TrainingLimit
}
func (h *hnsw) ShouldCompressFromConfig(config config.VectorIndexConfig) (bool, int) {
hnswConfig := config.(ent.UserConfig)
return hnswConfig.PQ.Enabled, hnswConfig.PQ.TrainingLimit
}
func (h *hnsw) Compressed() bool {
return h.compressed.Load()
}
func (h *hnsw) Upgraded() bool {
return h.Compressed()
}
func (h *hnsw) AlreadyIndexed() uint64 {
return uint64(h.cache.CountVectors())
}
func (h *hnsw) normalizeVec(vec []float32) []float32 {
if h.distancerProvider.Type() == "cosine-dot" {
// cosine-dot requires normalized vectors, as the dot product and cosine
// similarity are only identical if the vector is normalized
return distancer.Normalize(vec)
}
return vec
}