US 12,248,521 B1
Search using an overlay graph mapping to source knowledge graphs
Rosario Uceda-Sosa, Hartsdale, NY (US); Guilherme Augusto Ferreira Lima, Campinas (BR); Achille Belly Fokoue-Nkoutche, White Plains, NY (US); Alexander Gray, Yonkers, NY (US); Maria Chang, Irvington, NY (US); and Marcelo Machado, Rio de Janeiro (BR)
Assigned to INTERNATIONAL BUSINESS MACHINES CORPORATION, Armonk, NY (US)
Filed by INTERNATIONAL BUSINESS MACHINES CORPORATION, Armonk, NY (US)
Filed on Aug. 28, 2023, as Appl. No. 18/456,999.
Int. Cl. G06F 16/90 (2019.01); G06F 16/903 (2019.01); G06F 16/9038 (2019.01)
CPC G06F 16/9038 (2019.01) [G06F 16/90335 (2019.01)] 20 Claims
OG exemplary drawing
 
1. A computer-implemented method, comprising operations for:
generating a plurality of overlay graphs, wherein each overlay graph comprises entities represented by nodes, relations represented by edges, and mappings, wherein the mappings of each of the plurality of overlay graphs map the entities and the relations of that overlay graph to a subset of entities and relations in a plurality of source knowledge graphs, and wherein each of the plurality of overlay graphs is associated with logical rules that describe how to map new entities and new relations of the plurality of source knowledge graphs to that overlay graph;
receiving a search request comprising an entity and a relation;
selecting an overlay graph from the plurality of overlay graphs based on the entity and the relation of the search request;
issuing the search request against the overlay graph, wherein the search request is translated to knowledge graph specific queries, and wherein the knowledge graph specific queries are issued against the plurality of source knowledge graphs;
receiving search results from the plurality of source knowledge graphs; and
using the search results to respond to the search request.