WO2025109374 - SYSTEMS AND METHODS FOR GRAPH TRAVERSAL FOR APPROXIMATE NEAREST NEIGHBOR SEARCH
National phase entry is expected:
Publication Number
WO/2025/109374
Publication Date
30.05.2025
International Application No.
PCT/IB2024/000673
International Filing Date
20.11.2024
Title **
[English]
SYSTEMS AND METHODS FOR GRAPH TRAVERSAL FOR APPROXIMATE NEAREST NEIGHBOR SEARCH
[French]
SYSTÈMES ET PROCÉDÉS DE TRAVERSÉE DE GRAPHE POUR UNE RECHERCHE DE VOISIN APPROXIMATIVEMENT LE PLUS PROCHE
Applicants **
SAMSUNG ELECTRONICS CO., LTD.
Inventors
WANG, Yitu
CHANG, Andrew, Zhenwen
Priority Data
63/601,663
21.11.2023
US
18/953,055
19.11.2024
US
Application details
| Total Number of Claims/PCT | * |
| Number of Independent Claims | * |
| Number of Priorities | * |
| Number of Multi-Dependent Claims | * |
| Number of Drawings | * |
| Pages for Publication | * |
| Number of Pages with Drawings | * |
| Pages of Specification | * |
| * | |
| Number of Office Actions | * |
| * | |
International Searching Authority |
MOIP
* |
| Recordal of a Change of the Applicant's Name/Address |
Change of Applicant's Name and Address
* |
| Type of Assignment |
The Standard Agent's Assignment
* |
| Applicant's Legal Status |
Legal Entity
* |
| * | |
| * | |
| * | |
| * | |
| * | |
| Entry into National Phase under |
Chapter I
* |
| Patent Delivery |
Send the Letters Patent by Courier
* |
| Translation |
|
* The data is based on automatic recognition. Please verify and amend if necessary.
** IP-Coster compiles data from publicly available sources. If this data includes your personal information, you can contact us to request its removal.
Quotation for National Phase entry
| Country | Stages | Total | |
|---|---|---|---|
| China | Filing, Examination, Granting | 2344 | |
| EPO | Filing, Examination, Granting | 14281 | |
| Japan | Filing, Examination, Granting | 2337 | |
| South Korea | Filing, Examination, Granting | 1893 | |
| USA | Filing, Examination, Granting | 4740 |
Total:
25,595
The term for entry into the National Phase has expired. This quotation is for informational purposes only
Contact Us
Abstract[English]
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.[French]
L'invention divulgue un système et un procédé de recherche de voisin approximativement le plus proche. Un circuit de stockage d'interrogation stocke des informations d'interrogation se rapportant à au moins une interrogation provenant d'un hôte dans une table de propriétés d'interrogation. Un circuit générateur et allocateur est configuré pour générer des informations de graphe à l'aide d'un lot d'au moins un sommet correspondant à la ou aux interrogations à partir de la table de propriétés d'interrogation et pour attribuer la ou les interrogations à au moins une unité logique (LU) sur la base des informations de graphe. Un circuit de recherche comprend la ou les LU et est configuré pour calculer au moins une distance, à l'aide des informations de graphe, entre le ou les sommets et au moins un voisin candidat du ou des sommets pour générer au moins un résultat de distance. La table de propriétés d'interrogation est modifiée sur la base du ou des résultats de distance.