US 12,481,701 B1
Deconstructing graphs using a database management approach
Ping Liu, Weston, FL (US); Jose Eduardo Corona Espinoza, San Francisco, CA (US); Priya Santosh Bannur, Sunnyvale, CA (US); Andrii Soviak, San Jose, CA (US); Qianqi Shen, Saratoga, CA (US); and Jianqiang Shen, San Mateo, CA (US)
Assigned to Microsoft Technology Licensing, LLC, Redmond, WA (US)
Filed by Microsoft Technology Licensing, LLC, Redmond, WA (US)
Filed on Oct. 17, 2024, as Appl. No. 18/919,116.
Int. Cl. G06F 16/2455 (2019.01); G06F 16/901 (2019.01)
CPC G06F 16/9024 (2019.01) [G06F 16/2456 (2019.01); G06F 16/24565 (2019.01)] 20 Claims
OG exemplary drawing
 
1. A method comprising:
receiving an event trigger associated with a first node of a graph, the event trigger including a node identifier of the first node;
generating a first query for a neighbor identifier associated with a second node of the graph using the node identifier, wherein the neighbor identifier is queried from a first data store;
generating a second query for a feature corresponding to the neighbor identifier, wherein the feature is queried from a second data store;
generating an embedding of the event trigger using the node identifier, the neighbor identifier and the feature; and
storing the embedding of the event trigger in a third data store.