Optimistic Query Routing in Clustering-based Approximate Maximum Inner Product Search

Sebastian Bruch, Aditya Krishnan, Franco Maria Nardini

Clustering-based nearest neighbor search is an effective method in which points are partitioned into geometric shards to form an index, with only a few shards searched during query…