Metric:
Euclidean (L2)
Cosine Sim
Search Step:
1: Entry
2: Refine
3: Result
Pause
Reset
01 / LINEAR SCAN
O(N) EXHAUSTIVE
QUERY Q
P0
P1
P2
P3
P4
P5
3.82
2.45
1.12
0.34
1.98
4.10
EVALUATION METRICS
EVALUATED POINTS:
0 / 6
BEST MATCH:
--
SCORE METRIC:
EUCLIDEAN DIST
02 / SPATIAL PRUNING
O(LOG N) BBSP
ROOT [SPLIT X]
LEFT [SPLIT Y]
RIGHT [PRUNED]
CELL A
CELL B
CELL C
CELL D
2D BOUNDING PARTITION MAP
CELL A
CELL B
CELL C (PRUNED)
CELL D (PRUNED)
Q
03 / HNSW GRAPH
O(LOG N) HIERARCHY
LAYER 1: EXPRESS HIGHWAY
ENTRY (H1)
HIGHWAY (H2)
LAYER 0: DENSE LOCAL GRAPH
NODE A
NODE B
NODE C
NODE D
TOP-K PRIORITY HEAP (K=2)
1. NODE B (DIST: 0.34) - [BEST MATCH]
2. NODE C (DIST: 0.48)
HOPS COMPLETED:
3 HOPS
HOVER / CLICK NODE
Hover or click any node to inspect spatial partitioning, graph layer routing, or evaluation metrics.
METRIC: EUCLIDEAN