Proximity graph maintenance for fast online nearest neighbor search

• Main Authors: XU ZHAOZHUO, TAN SHULONG, LI PING, ZHOU ZHIXIN, ZHAO WEIJIE
• Format: Patent
• Language: Chinese; English
• Published: 07.04.2023
• Subjects: CALCULATING; COMPUTING; COUNTING; ELECTRIC DIGITAL DATA PROCESSING; PHYSICS

An incremental proximity graph maintenance (IPGM) system and method for online ANN search supports online vertex deletion and vertex insertion on a proximity graph. In various embodiments, updating the neighbor graph includes receiving a workload representing a set of vertices in the neighbor graph, each vertex associated with a type of operation such as a query, insertion or deletion. For a query or insertion, a search may be performed on a graph to obtain a set of first K vertices per vertex. In the event of deletion, the vertices may be deleted from the neighbor graph, and at least a portion of the neighbor graph may be reconstructed using a local or global reconnection update method. 用于在线ANN搜索的增量邻近图维护(IPGM)系统和方法支持邻近图上的在线顶点删除和顶点插入。在各种实施例中，更新邻近图包括接收表示邻近图中的一组顶点的工作负载，每个顶点与诸如查询、插入或删除的操作类型相关联。对于查询或插入，可以在图形上执行搜索以获得每个顶点的一组前K个顶点。在删除的情况下，可以从邻近图中删除顶点，并且可以使用局部或全局重新连接更新方法来重构邻近图的至少一部分。