公开(公告)号：US20210216590A1

公开(公告)日：2021-07-15

申请号：US16738972

申请日：2020-01-09

Applicant: ORACLE INTERNATIONAL CORPORATION

Inventor： ARNAUD DELAMARE ,  VASILEIOS TRIGONAKIS ,  JEAN-PIERRE LOZI ,  VLAD IOAN HAPRIAN ,  PETR KOUPY ,  HASSAN CHAFI ,  SUNGPACK HONG

IPC: G06F16/901 ,  G06F16/9032 ,  G06F16/903 ,  G06F16/2453

Abstract: Techniques are described herein for early pruning of potential graph query results. Specifically, based on determining that property values of a path through graph data cannot affect results of a query, the path is pruned from a set of potential query solutions prior to fully exploring the path. Early solution pruning is performed on prunable queries that project prunable functions including MIN, MAX, SUM, and DISTINCT, the results of which are not tied to a number of paths explored for query execution. A database system implements early solution pruning for a prunable query based on intermediate results maintained for the query during query execution. Specifically, when a system determines that property values of a given potential solution path cannot affect the query results reflected in intermediate results maintained for the query, the path is discarded from the set of possible query solutions without further exploration of the path.

公开(公告)号：US20230376486A1

公开(公告)日：2023-11-23

申请号：US17750339

申请日：2022-05-21

Applicant: ORACLE INTERNATIONAL CORPORATION

Inventor： VASILEIOS TRIGONAKIS ,  CALIN IORGULESCU ,  TOMAS FALTIN ,  SUNGPACK HONG ,  HASSAN CHAFI

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

CPC classification number: G06F16/24542 ,  G06F16/27 ,  G06F9/4881 ,  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.

公开(公告)号：US20250053563A1

公开(公告)日：2025-02-13

申请号：US18934068

申请日：2024-10-31

Applicant: Oracle International Corporation

Inventor： ARNAUD DELAMARE ,  IRFAN BUNJAKU ,  VASILEIOS TRIGONAKIS ,  CALIN IORGULESCU ,  TOMAS FALTIN ,  SUNGPACK HONG ,  HASSAN CHAFI

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

Abstract: A storage manager maintains metadata for a plurality of graph components including, for each given graph component, a memory-state indicator that indicates whether the given graph component is stored in memory. The storage manager identifies a set of graph components required to execute a graph processing operation and identifies, based on the metadata, a first subset of the set of graph components that are stored in the memory and a second subset of the set of graph components that are not stored in the memory. The storage manager loads the second subset of graph components into memory and initiates execution of the graph processing operation using the set of graph components in memory.

公开(公告)号：US20250045331A1

公开(公告)日：2025-02-06

申请号：US18228487

申请日：2023-07-31

Applicant: Oracle International Corporation

Inventor： ARNAUD DELAMARE ,  GIORGOS XANTHAKIS ,  VASILEIOS TRIGONAKIS ,  SUNGPACK HONG ,  HASSAN CHAFI ,  JINSU LEE

IPC: G06F16/901 ,  G06F9/455 ,  G06F9/50

Abstract: A graph rebalancing approach is provided that allows a distributed graph system to effectively support elasticity by incrementally balancing distributed in-memory graphs uniformly or in a custom manner on a set of given machines. Performing the incremental rebalancing operation comprises selecting a chunk in a source machine in the cluster having a surplus of chunks, selecting a target machine in the cluster having a deficit of chunks, transferring the selected chunk from the source machine to the target machine, and updating metadata in each machine in the cluster to reflect a location of the graph data elements in the selected chunk in the target machine.

公开(公告)号：US20240184780A1

公开(公告)日：2024-06-06

申请号：US18073629

申请日：2022-12-02

Applicant: Oracle International Corporation

Inventor： TOMÁ FALTÍN ,  VASILEIOS TRIGONAKIS ,  SUNGPACK HONG ,  HASSAN CHAFI

IPC: G06F16/2453 ,  G06F16/901

CPC classification number: G06F16/24542 ,  G06F16/9024

Abstract: A graph processing system is provided for executing scouting queries for improving query planning. A query planner creates a plurality of scouting queries, each scouting query in the plurality of scouting queries corresponding to a query plan for a graph query and having an associated confidence value. A graph processing system performs limited execution of the plurality of scouting queries and determines a metric value for each scouting query in the plurality of scouting queries based on execution of the scouting query. The system determines a score for each scouting query in the plurality of scouting queries based on its metric value and the confidence value of the corresponding query plan and selects a query plan based on the scores of the plurality of scouting queries. The system executes the graph query based on the selected query plan.

公开(公告)号：US20240143594A1

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

申请号：US18211613

申请日：2023-06-20

Applicant: Oracle International Corporation

Inventor： ARNAUD DELAMARE ,  IRFAN BUNJAKU ,  VASILEIOS TRIGONAKIS ,  CALIN IORGULESCU ,  TOMAS FALTIN ,  SUNGPACK HONG ,  HASSAN CHAFI

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

CPC classification number: G06F16/24552 ,  G06F16/22 ,  G06F16/2343 ,  G06F16/24542

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.