Systems and methods for graph traversal for approximate nearest neighbor search

A method comprising:

• storing, in a query property table, query information related to at least one query from a host, the query information being represented in a format;
• generating graph information using a batch of at least one vertex corresponding to the at least one query from the query property table;
• allocating the at least one query to at least one logic unit (LU) based on the graph information;
• computing 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;
• and
• modifying the query property table based on the at least one distance result.

A system comprising:

• a static scheduler configured to reorder an original graph having at least one original vertex to generate a batch of at least one vertex using a reordering procedure that is based on vertex degree in an ascending order;
• and
• a dynamic scheduler configured to compute at least one distance in the batch of the at least one vertex, the dynamic scheduler comprising:
• a query storage circuit to store query information related to at least one query from a host in a query property table, the query information being represented in a format;
• a generator and allocator circuit configured to generate graph information using the batch of the at least one vertex corresponding to the at least one query from the query property table and to allocate the at least one query to at least one logic unit (LU) based on the graph information;
• a search circuit having the at least one LU and configured to compute the 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,
• wherein the query property table is modified based on the at least one distance result;
• and
• a sort circuit configured to sort the at least one distance in the at least one distance result and send at least one candidate neighbor corresponding to at least one highest ranking distance to the host.