A sub-linear time algorithm for approximating k-nearest-neighbor with full quality guarantee

•We propose an algorithm that unifies the distance and recall criteria for the approximate k-Nearest-Neighbor problem.•The algorithm is the first one for the studied problem that provides theoretical guarantee on both approximation criteria.•The algorithm is the first one that achieves sub-linear query time while providing theoretical guarantees.