公开(公告)号：US20210279282A1

公开(公告)日：2021-09-09

申请号：US17330046

申请日：2021-05-25

Applicant: Oracle International Corporation

Inventor： DAMIEN HILLOULIN ,  DAVIDE BARTOLINI ,  OSKAR VAN REST ,  Alexander Weld ,  Sungpack Hong ,  Hassan Chafi

IPC: G06F16/901 ,  G06F16/28 ,  G06F16/22

Abstract: Techniques are provided herein for efficient representation of heterogeneous graphs in memory. In an embodiment, vertices and edges of the graph are segregated by type. Each property of a type of vertex or edge has values stored in a respective vector. Directed or undirected edges of a same type are stored in compressed sparse row (CSR) format. The CSR format is more or less repeated for edge traversal in either forward or reverse direction. An edge map translates edge offsets obtained from traversal in the reverse direction for use with data structures that expect edge offsets in the forward direction. Subsequent filtration and/or traversal by type or property of vertex or edge entails minimal data access and maximal data locality, thereby increasing efficient use of the graph.

公开(公告)号：US20190325075A1

公开(公告)日：2019-10-24

申请号：US15956115

申请日：2018-04-18

Applicant: Oracle International Corporation

Inventor： DAMIEN HILLOULIN ,  DAVIDE BARTOLINI ,  OSKAR VAN REST ,  Alexander Weld ,  Sungpack Hong ,  Hassan Chafi

IPC: G06F17/30

Abstract: Techniques are provided herein for efficient representation of heterogeneous graphs in memory. In an embodiment, vertices and edges of the graph are segregated by type. Each property of a type of vertex or edge has values stored in a respective vector. Directed or undirected edges of a same type are stored in compressed sparse row (CSR) format. The CSR format is more or less repeated for edge traversal in either forward or reverse direction. An edge map translates edge offsets obtained from traversal in the reverse direction for use with data structures that expect edge offsets in the forward direction. Subsequent filtration and/or traversal by type or property of vertex or edge entails minimal data access and maximal data locality, thereby increasing efficient use of the graph.