Our implementation

• Candidate k-NN Array

• Priority Queue PQ

Candidate k-NN Array

<empty>

PQ

1: <b, d(Q, b)>

2: <a, d(Q, a)>

Candidate k-NN Array

<G, d(Q, G)>

PQ

1: <a, d(Q, a)>

Candidate k-NN Array

<D, d(Q, D)>

PQ

<empty>

Space usage = O(number of nodes +k) = O(n/fanout+k)

Previous slide

Next slide

Back to first slide

View graphic version