Query with Trees
Given: query vector
v
q
, index tree.
Method involves:
a search over the tree
a "nearest neighbour (NN) region"
(related to
maxD
in the original search method)
.
Consider the following space and two query points
q1
and
q2
.
![[Diagram:pic/qspace]](pic/qspace.gif)
![[prev]](icon/prev.gif){kind=icon}
![[index]](icon/up.gif){kind=icon}
![[next]](icon/next.gif){kind=icon}