Proximity Graph Maintenance for Fast Online Nearest Neighbor Search

06/22/2022
by   Zhaozhuo Xu, et al.
0

Approximate Nearest Neighbor (ANN) search is a fundamental technique for (e.g.,) the deployment of recommender systems. Recent studies bring proximity graph-based methods into practitioners' attention – proximity graph-based methods outperform other solutions such as quantization, hashing, and tree-based ANN algorithm families. In current recommendation systems, data point insertions, deletions, and queries are streamed into the system in an online fashion as users and items change dynamically. As proximity graphs are constructed incrementally by inserting data points as new vertices into the graph, online insertions and queries are well-supported in proximity graph. However, a data point deletion incurs removing a vertex from the proximity graph index, while no proper graph index updating mechanisms are discussed in previous studies. To tackle the challenge, we propose an incremental proximity graph maintenance (IPGM) algorithm for online ANN. IPGM supports both vertex deletion and insertion on proximity graphs. Given a vertex deletion request, we thoroughly investigate solutions to update the connections of the vertex. The proposed updating scheme eliminates the performance drop in online ANN methods on proximity graphs, making the algorithm suitable for practical systems.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/27/2021

Understanding and Generalizing Monotonic Proximity Graphs for Approximate Nearest Neighbor Search

Graph-based algorithms have shown great empirical potential for the appr...
research
11/29/2017

Online Product Quantization

Approximate nearest neighbor (ANN) search has achieved great success in ...
research
01/23/2022

Reinforcement Routing on Proximity Graph for Efficient Recommendation

We focus on Maximum Inner Product Search (MIPS), which is an essential p...
research
07/19/2023

Fast Approximate Nearest Neighbor Search with a Dynamic Exploration Graph using Continuous Refinement

For approximate nearest neighbor search, graph-based algorithms have sho...
research
10/26/2022

Constrained Approximate Similarity Search on Proximity Graph

Search engines and recommendation systems are built to efficiently displ...
research
09/01/2023

General and Practical Tuning Method for Off-the-Shelf Graph-Based Index: SISAP Indexing Challenge Report by Team UTokyo

Despite the efficacy of graph-based algorithms for Approximate Nearest N...
research
03/30/2016

Efficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphs

We present a new algorithm for the approximate K-nearest neighbor search...

Please sign up or login with your details

Forgot password? Click here to reset