Granted Patent B1

US 12,248,521 · App. 18/456,999 · Granted Mar 11, 2025

Inventors: Rosario Uceda-Sosa (Hartsdale, NY); Guilherme Augusto Ferreira Lima (Campinas, BR); Achille Belly Fokoue-Nkoutche (White Plains, NY); Alexander Gray (Yonkers, NY); Maria Chang (Irvington, NY); Marcelo Machado (Rio de Janeiro, BR)

Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION

G06F16/9038G06F16/90335

Abstract

Claims (60)

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.

2. The computer-implemented method of claim 1 , comprising operations for:

determining that a source knowledge graph of the plurality of source knowledge graphs has changed; and

using logical rules associated with the overlay graph to modify the overlay graph.

3. The computer-implemented method of claim 1 , comprising operations for:

translating the search request into a first query; and

identifying entities and relations of the first query that are also found in the plurality of source knowledge graphs.

4. The computer-implemented method of claim 3 , comprising operations for:

translating the first query into a second query based on the identified entities and relations; and

issuing the second query against the overlay graph to identify corresponding entities and relations in the overlay graph that correspond to the entities and the relations of the first query.

5. The computer-implemented method of claim 1 , wherein the plurality of source knowledge graphs comprise a plurality of ontological knowledge graphs, and wherein the overlay graph maps to the plurality of ontological knowledge graphs to present a single, unified, semantic view of the entities and the relations of the plurality of ontological knowledge graphs.

6. The computer-implemented method of claim 1 , wherein each of the mappings is associated with a probability.

7. The computer-implemented method of claim 1 , comprising operations for:

translating the search results into a format corresponding to the search request.

8. A computer program product, the computer program product comprising a computer readable storage medium having program instructions embodied therewith, the program instructions executable by a processor to cause the processor to perform 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.

9. The computer program product of claim 8 , wherein the program instructions executable by the processor to cause the processor to further perform operations for:

determining that a source knowledge graph of the plurality of source knowledge graphs has changed; and

using logical rules associated with the overlay graph to modify the overlay graph.

10. The computer program product of claim 8 , wherein the program instructions executable by the processor to cause the processor to further perform operations for:

translating the search request into a first query; and

identifying entities and relations of the first query that are also found in the plurality of source knowledge graphs.

11. The computer program product of claim 10 , wherein the program instructions executable by the processor to cause the processor to further perform operations for:

translating the first query into a second query based on the identified entities and relations; and

issuing the second query against the overlay graph to identify corresponding entities and relations in the overlay graph that correspond to the entities and the relations of the first query.

12. The computer program product of claim 8 , wherein the plurality of source knowledge graphs comprise a plurality of ontological knowledge graphs, and wherein the overlay graph maps to the plurality of ontological knowledge graphs to present a single, unified, semantic view of the entities and the relations of the plurality of ontological knowledge graphs.

13. The computer program product of claim 8 , wherein each of the mappings is associated with a probability.

14. The computer program product of claim 8 , comprising operations for:

translating the search results into a format corresponding to the search request.

15. A computer system, comprising:

one or more processors, one or more computer-readable memories and one or more computer-readable, tangible storage devices; and

program instructions, stored on at least one of the one or more computer-readable, tangible storage devices for execution by at least one of the one or more processors via at least one of the one or more computer-readable memories, to perform operations comprising:

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.

16. The computer system of claim 15 , wherein the program instructions further perform operations comprising:

determining that a source knowledge graph of the plurality of source knowledge graphs has changed; and

using logical rules associated with the overlay graph to modify the overlay graph.

17. The computer system of claim 15 , wherein the program instructions further perform operations comprising:

translating the search request into a first query; and

identifying entities and relations of the first query that are also found in the plurality of source knowledge graphs.

18. The computer system of claim 17 , wherein the program instructions further perform operations comprising:

translating the first query into a second query based on the identified entities and relations; and

issuing the second query against the overlay graph to identify corresponding entities and relations in the overlay graph that correspond to the entities and the relations of the first query.

19. The computer system of claim 15 , wherein the plurality of source knowledge graphs comprise a plurality of ontological knowledge graphs, and wherein the overlay graph maps to the plurality of ontological knowledge graphs to present a single, unified, semantic view of the entities and the relations of the plurality of ontological knowledge graphs.

20. The computer system of claim 15 , wherein each of the mappings is associated with a probability.

Assignments (2)

References Cited (37)