公开(公告)号：US11907255B2

公开(公告)日：2024-02-20

申请号：US17686938

申请日：2022-03-04

Applicant: Oracle International Corporation

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

IPC: G06F17/00 ,  G06F16/27 ,  G06F16/22 ,  G06F16/28

CPC classification number: G06F16/27 ,  G06F16/2282 ,  G06F16/284

Abstract: In an embodiment, multiple computers cooperate to retrieve content from tables in a relational database. Each table contains respective rows. Each row contains a vertex of a graph. Many high-degree vertices are identified. Each high-degree vertex is connected to respective edges in the graph. A count of the edges of each high-degree vertex exceeds a degree threshold. A central computer detects that all vertices in a high-degree subset of tables are high-degree vertices. Based on detecting the high-degree subset of tables, multiple vertices of the graph that are not in the high-degree subset of tables are replicated. Within local storage capacity limits of the computers, this degree-based replication may be supplemented with other vertex replication strategies that are schema based, content based, or workload based. This intelligent selective replication maximizes system throughput by minimizing graph data access latency based on data locality.

公开(公告)号：US20230281219A1

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

申请号：US17686938

申请日：2022-03-04

Applicant: Oracle International Corporation

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

IPC: G06F16/27 ,  G06F16/28 ,  G06F16/22

CPC classification number: G06F16/27 ,  G06F16/284 ,  G06F16/2282

Abstract: In an embodiment, multiple computers cooperate to retrieve content from tables in a relational database. Each table contains respective rows. Each row contains a vertex of a graph. Many high-degree vertices are identified. Each high-degree vertex is connected to respective edges in the graph. A count of the edges of each high-degree vertex exceeds a degree threshold. A central computer detects that all vertices in a high-degree subset of tables are high-degree vertices. Based on detecting the high-degree subset of tables, multiple vertices of the graph that are not in the high-degree subset of tables are replicated. Within local storage capacity limits of the computers, this degree-based replication may be supplemented with other vertex replication strategies that are schema based, content based, or workload based. This intelligent selective replication maximizes system throughput by minimizing graph data access latency based on data locality.

公开(公告)号：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.

公开(公告)号：US20230121198A1

公开(公告)日：2023-04-20

申请号：US18084406

申请日：2022-12-19

Applicant: Oracle International Corporation

Inventor： Petr Koupy ,  Thomas Manhardt ,  Siegfried Depner ,  Sungpack Hong ,  Hassan Chafi

IPC: G06F8/41 ,  G06F9/50 ,  G06F17/16 ,  G06F16/27 ,  G06F17/10 ,  G06F11/34

Abstract: Techniques herein minimally communicate between computers to repartition a graph. In embodiments, each computer receives a partition of edges and vertices of the graph. For each of its edges or vertices, each computer stores an intermediate representation into an edge table (ET) or vertex table. Different edges of a vertex may be loaded by different computers, which may cause a conflict. Each computer announces that a vertex resides on the computer to a respective tracking computer. Each tracking computer makes assignments of vertices to computers and publicizes those assignments. Each computer that loaded conflicted vertices transfers those vertices to computers of the respective assignments. Each computer stores a materialized representation of a partition based on: the ET and vertex table of the computer, and the vertices and edges that were transferred to the computer. Edges stored in the materialized representation are stored differently than edges stored in the ET.

公开(公告)号：US11561780B2

公开(公告)日：2023-01-24

申请号：US17069104

申请日：2020-10-13

Applicant: Oracle International Corporation

Inventor： Petr Koupy ,  Thomas Manhardt ,  Siegfried Depner ,  Sungpack Hong ,  Hassan Chafi

IPC: G06F16/00 ,  G06F8/41 ,  G06F9/50 ,  G06F17/16 ,  G06F16/27 ,  G06F17/10 ,  G06F11/34 ,  G06F3/06 ,  G06F11/10 ,  G06F16/901

Abstract: Techniques herein minimally communicate between computers to repartition a graph. In embodiments, each computer receives a partition of edges and vertices of the graph. For each of its edges or vertices, each computer stores an intermediate representation into an edge table (ET) or vertex table. Different edges of a vertex may be loaded by different computers, which may cause a conflict. Each computer announces that a vertex resides on the computer to a respective tracking computer. Each tracking computer makes assignments of vertices to computers and publicizes those assignments. Each computer that loaded conflicted vertices transfers those vertices to computers of the respective assignments. Each computer stores a materialized representation of a partition based on: the ET and vertex table of the computer, and the vertices and edges that were transferred to the computer. Edges stored in the materialized representation are stored differently than edges stored in the ET.