Browse files

doc for S

  • Loading branch information...
aaalgo committed Jun 17, 2016
1 parent 953c36c commit 336fd2984df011d0106f1ced88acb351817214c0
Showing with 19 additions and 0 deletions.
  1. +19 −0 Changes
19 Changes
@@ -1,3 +1,22 @@
Adding a parameter SearchParams::S which is the online
equivalence of IndexParams::S. At search time, all
neighbors or a neighbor are visited at the same time
in the original algorithm. With the new behavior,
neighbors are visited in batches of SearchParams::S.
k-NN working list: a b c d e [f] g
[l m n] o p q
we are at entry f, and visiting it's first batch of
neighbors l, m and n. Suppose m and n are actually
better than f and g, the working space will become
a b c d e [m] n
We'll then directly move on to check m's neighbors,
as apposed to finish checking f's neighbors o p and q.
Default is set to default_s = 10 which is the same for
Enabling edge reversing for better search performance.
The original index is the exact k-NN graph, and has

0 comments on commit 336fd29

Please sign in to comment.