US 12,242,536 B2
Adjacency structure for heterogeneous graph data
Matthias Hauck, Frankfurt (DE); Hannes Jakschitsch, Mannheim (DE); Umang Rawat, Heidelberg (DE); and Romans Kasperovics, Speyer (DE)
Assigned to SAP SE, Walldorf (DE)
Filed by SAP SE, Walldorf (DE)
Filed on Jun. 23, 2022, as Appl. No. 17/847,836.
Prior Publication US 2023/0418870 A1, Dec. 28, 2023
Int. Cl. G06F 16/901 (2019.01)
CPC G06F 16/9024 (2019.01) 16 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:
generating, for each of a plurality of vertex tables and edge tables of a heterogeneous graph, an adjacency structure including a vertex adjacency structure specifying a plurality of neighboring vertices in the heterogeneous graph and an edge adjacency structure specifying a plurality of neighboring edges in the heterogeneous graph,
wherein the plurality of vertex tables comprise a first vertex table and a second vertex table that do not share at least one attribute, wherein the first vertex table and the second vertex table are associated with a first vertex dictionary and a second vertex dictionary, wherein the first vertex dictionary includes, for a first vertex in the first vertex table, a first local identifier that is unique across the first vertex dictionary and a first global identifier that is unique across a set of vertex dictionaries, wherein the second vertex dictionary includes, for a second vertex in the second vertex table, a second local identifier that is unique across the second vertex dictionary and a second global identifier that is unique across the set of vertex dictionaries; and
executing, based at least on the generated adjacency structure, graph processing for a database management system using the plurality of vertex tables and the edge tables of heterogeneous graph including the first vertex dictionary and the second vertex dictionary.