US 12,405,972 B2
Systems and methods for manipulating time-dependent relationships in knowledge graph data structures
Jan Portisch, Bruchsal (DE); and Sandra Bracholdt, Dielheim (DE)
Assigned to SAP SE, Walldorf (DE)
Filed by SAP SE, Walldorf (DE)
Filed on Oct. 25, 2022, as Appl. No. 17/973,311.
Prior Publication US 2024/0134887 A1, Apr. 25, 2024
Prior Publication US 2024/0232233 A9, Jul. 11, 2024
Int. Cl. G06F 16/00 (2019.01); G06F 16/22 (2019.01); G06F 16/2458 (2019.01); G06F 16/28 (2019.01)
CPC G06F 16/288 (2019.01) [G06F 16/2228 (2019.01); G06F 16/2477 (2019.01)] 20 Claims
OG exemplary drawing
 
1. A computing system for utilizing relationship data, the computing system comprising:
at least one processor programmed to perform operations comprising:
receiving, from a second computing system, a first time-dependent query against a knowledge graph data structure, the first time-dependent query comprising an indication of a first test relationship, and an indication of a first test point-in-time, the first test relationship being described by a first time period during which the first test relationship is true;
accessing confirmation data from the knowledge graph data structure, the confirmation data describing a first plurality of confirmation points-in-time at which the first test relationship is true;
determining that at least one of a beginning or an end of the first time period is not defined by the knowledge graph data structure at least in part by determining that the first plurality of confirmation points-in-time do not extend past at least one of the beginning or the end of the first time period;
determining a response to the first time-dependent query indicating a veracity of the first test relationship at the first test point-in-time using the first plurality of confirmation points-in-time; and
sending the response to the first time-dependent query to the second computing system.