SYSTEMS AND METHODS FOR GRAPH TRAVERSAL FOR APPROXIMATE NEAREST NEIGHBOR SEARCH

Abstract: a system and a method for approximate nearest neighbor search are disclosed. a query storage circuit stores query information related to at least one query from a host in a query property table. a generator and allocator circuit is configured to generate graph information using a batch of at least one vertex corresponding to the at least one queries from the query property table and to allocate the at least one queries to at least one logic unit (lu) based on the graph information. a search circuit has the at least one lu and is configured to compute at least one distance, using the graph information, between the at least one vertex and at least one candidate neighbor of the at least one vertex to generate at least one distance result. the query property table is modified based on the at least one distance result.

Inventor(s): Yitu WANG, Andrew Zhenwen CHANG

CPC Classification: G06F16/24534 ({Query rewriting; Transformation})

Search for rejections for patent application number 20250165468