Fig. 1
From: GEMINI: a computationally-efficient search engine for large gene expression datasets
Vantage-point tree structure allows search algorithm to fathom subtrees. Given we have already found a record at distance τ from the query node q and we are at vantage point p with a right subtree containing records further than μ from p and a left subtree with records closer than μ. a If d(p,q)≥τ+μ, then the nearest-neighbor is not closer than μ and we can fathom the left subtree containing records closer than μ. b If d(p,q)+τ≤μ, then the nearest-neighbor is certainly closer than μ and we can fathom the right subtree