US 12,013,899 B2
Building a graph index and searching a corresponding dataset
Harsha Vardhan Simhadri, Telangana (IN); Ravishankar Krishnaswamy, Tamil Nadu (IN); Suhas Jayaram Subramanya, Pittsburgh, PA (US); and Devvrit, Austin, TX (US)
Assigned to Microsoft Technology Licensing, LLC, Redmond, WA (US)
Filed by Microsoft Technology Licensing, LLC, Redmond, WA (US)
Filed on Mar. 3, 2023, as Appl. No. 18/178,343.
Application 18/178,343 is a continuation of application No. 16/582,682, filed on Sep. 25, 2019, granted, now 11,599,578, issued on Mar. 7, 2023.
Claims priority of provisional application 62/868,664, filed on Jun. 28, 2019.
Prior Publication US 2023/0205822 A1, Jun. 29, 2023
This patent is subject to a terminal disclaimer.
Int. Cl. G06F 16/901 (2019.01); G06F 16/903 (2019.01); G06F 16/9035 (2019.01); G06F 18/2413 (2023.01)
CPC G06F 16/9024 (2019.01) [G06F 16/90335 (2019.01); G06F 16/9035 (2019.01); G06F 18/24147 (2023.01)] 20 Claims
OG exemplary drawing
 
1. A method, comprising:
receiving a search graph representative of a dataset of points, the search graph including a set of vertices associated with the dataset of points;
generating an updated search graph by iteratively applying a search algorithm for each vertex of the set of vertices and refining out-neighbor data between iterations of the search graph to reduce a number of hops between vertices of the set of vertices while ensuring that each vertex from the set of vertices includes a navigable path from each vertex to a start vertex; and
providing the updated search graph for storage on a computing device.