Techniques related to approximate nearest neighbor searching are discussed. Such techniques may include traversing an approximate nearest neighbor search tree from root node to a resultant leaf node while maintaining a priority queue of best matches, determining candidate entries for evaluation based on the resultant leaf node, and generating search results based on the priority queue and the candidate entries.