公开(公告)号：US11947539B2

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

申请号：US17750339

申请日：2022-05-21

Applicant: ORACLE INTERNATIONAL CORPORATION

Inventor： Vasileios Trigonakis ,  Calin Iorgulescu ,  Tomas Faltin ,  Sungpack Hong ,  Hassan Chafi

IPC: G06F16/00 ,  G06F9/48 ,  G06F16/2453 ,  G06F16/27 ,  G06F16/901

CPC classification number: G06F16/24542 ,  G06F9/4881 ,  G06F16/27 ,  G06F16/9024

Abstract: Techniques to efficiently assign available workers to executing multiple graph queries concurrently on a distributed graph database are disclosed. The techniques comprise a runtime engine assigning multiple workers to executing portions of multiple graph queries, each worker in each assignment asynchronously executing a portion of a graph query within a parallel-while construct that includes return statements at different locations, and the runtime engine reassigning a worker to executing another portion of the same or a different graph query to optimize the overall performance of all workers.

公开(公告)号：US20250139164A1

公开(公告)日：2025-05-01

申请号：US18385602

申请日：2023-10-31

Applicant: Oracle International Corporation

Inventor： Laurent Daynes ,  Martin Brugnara ,  Jean-Pierre Lozi ,  Calin Iorgulescu ,  Marco Arnaboldi ,  Hugo Kapp ,  Vlad Ioan Haprian ,  Zhen Hua Liu ,  Sungpack Hong

IPC: G06F16/901

Abstract: Techniques are described for applying topological graph changes and traversing the modified graph. In an implementation, a set of compile processes schedules the graph changes caused by a DML (Data Manipulation Language) statement. Based on the requested graph operation in a received query for graph, a set of graph operation processes generate extensions to the graph that capture the changes to the graph by the DML. The received graph operation(s) are then performed by traversing both the existing graph and the generated extensions.

公开(公告)号：US20250094224A1

公开(公告)日：2025-03-20

申请号：US18369254

申请日：2023-09-18

Applicant: Oracle International Corporation

Inventor： Calin Iorgulescu ,  Martin Kucera ,  Vasileios Trigonakis ,  Arnaud Delamare ,  Petr Koupy ,  Jinsu Lee ,  Sungpack Hong ,  Hassan Chafi

IPC: G06F9/50 ,  G06F9/48

Abstract: A resource manager tracks the amount of available memory for a cluster of machines and for each machine in the cluster. The resource manager receives a reservation request from a job for a graph processing operation. The reservation request specifies an identification of the job, a type of reservation, and an amount of memory requested. The resource manager determines whether to grant the reservation request based on the type of reservation, the amount of memory requested, and the amount of available memory in the cluster or in one or more machines in the cluster. In response to determining to grant the reservation request, the resource manager sends a response to the job indicating an amount of memory reserved and adjusts the amount of available cluster memory and the amount of available machine memory for at least one machine in the cluster based on the amount of memory reserved.

公开(公告)号：US20250139096A1

公开(公告)日：2025-05-01

申请号：US18385617

申请日：2023-10-31

Applicant: Oracle International Corporation

Inventor： Laurent Daynes ,  Martin Brugnara ,  Jean-Pierre Lozi ,  Calin Iorgulescu ,  Marco Arnaboldi ,  Hugo Kapp ,  Vlad Ioan Haprian ,  Zhen Hua Liu ,  Sungpack Hong

IPC: G06F16/2455 ,  G06F16/22 ,  G06F16/23

Abstract: Techniques are described for applying topological graph changes and traversing the modified graph. In an implementation, a set of compile processes schedules the graph changes caused by a DML (Data Manipulation Language) statement. Based on the requested graph operation in a received query for graph, a set of graph operation processes generate extensions to the graph that capture the changes to the graph by the DML. The received graph operation(s) are then performed by traversing both the existing graph and the generated extensions.

公开(公告)号：US12174835B2

公开(公告)日：2024-12-24

申请号：US18211613

申请日：2023-06-20

Applicant: Oracle International Corporation

Inventor： Arnaud Delamare ,  Irfan Bunjaku ,  Vasileios Trigonakis ,  Calin Iorgulescu ,  Tomas Faltin ,  Sungpack Hong ,  Hassan Chafi

IPC: G06F17/30 ,  G06F16/22 ,  G06F16/23 ,  G06F16/2453 ,  G06F16/2455

Abstract: A storage manager for offloading graph components to persistent storage for reducing resident memory in a distributed graph processing engine is provided. The storage manager identifies a set of graph components required to execute a graph processing operation on a graph in a graph processing engine of a database system and reserves an amount of memory needed to load the set of graph components into memory. The storage manager loads the set of graph components into memory and initiates execution of the graph processing operation using the set of graph components in memory. The storage manager evicts one or more unused graph components from memory in response to receiving a request to free a requested amount of memory from memory.