US 11,681,716 B2
Extended path finding operations on graph data
Jan Bross, Sandhausen (DE); Marcus Paradies, Erfurt (DE); Romans Kasperovics, Speyer (DE); and Thomas Fischer, Sandhausen (DE)
Assigned to SAP SE, Walldorf (DE)
Filed by SAP SE, Walldorf (DE)
Filed on Aug. 12, 2020, as Appl. No. 16/991,945.
Application 16/991,945 is a continuation of application No. 15/946,385, filed on Apr. 5, 2018, granted, now 10,776,371.
Prior Publication US 2020/0372021 A1, Nov. 26, 2020
Int. Cl. G06F 16/2458 (2019.01); G06F 16/901 (2019.01)
CPC G06F 16/2465 (2019.01) [G06F 16/9024 (2019.01)] 18 Claims
OG exemplary drawing
 
1. A system, comprising:
at least one data processor; and
at least one memory storing instructions which, when executed by the at least one data processor, result in operations comprising:
receiving, from a client, a request to extract from a path a portion of an ordered sequence of one or more vertices and/or one or more edges forming the path, the path comprising two endpoints, the path represented as graph data stored in a database;
in response to the request, determining the portion of the ordered sequence of the one or more vertices and/or the one or more edges forming a shortest path between the two endpoints, the determining of the portion forming the shortest path further comprising determining, for each of the one or more vertices and/or the one or more edges, a weight corresponding to a function of one or more attributes specified by the request; and
returning, to the client, the portion of the ordered sequence of the one or more vertices and/or the one or more edges forming the shortest path.