公开(公告)号：US20230237047A1

公开(公告)日：2023-07-27

申请号：US17585117

申请日：2022-01-26

Applicant: Oracle International Corporation

Inventor： Vasileios Trigonakis ,  Paul Renauld ,  Jinsu Lee ,  Petr Koupy ,  Sungpack Hong ,  Hassan Chafi

IPC: G06F16/23 ,  G06F16/901

CPC classification number: G06F16/2379 ,  G06F16/9024

Abstract: Data structures and methods are described for applying mutations on a distributed graph in a fast and memory-efficient manner. Nodes in a distributed graph processing system may store graph information such as vertices, edges, properties, vertex keys, vertex degree counts, and other information in graph arrays, which are divided into shared arrays and delta logs. The shared arrays on a local node remain immutable and are the starting point of a graph, on top of which mutations build new snapshots. Mutations may be supported at both the entity and table levels. Periodic delta log consolidation may occur at multiple levels to prevent excessive delta log buildup. Consolidation at the table level may also trigger rebalancing of vertices across the nodes.