公开(公告)号：US20250138874A1

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

申请号：US18384743

申请日：2023-10-27

Applicant: Oracle International Corporation

Inventor： Ioannis Alagiannis ,  Vlad Ioan Haprian ,  Laurent Phillipe Daynes ,  Willibrord van Leeuwen ,  Jan Kleine ,  Sungpack Hong

IPC: G06F9/48 ,  G06F16/28

Abstract: The illustrative embodiments provide techniques that utilizes graph topology information to partition work according to ranges of vertices so that each unit of work can be computed independently by different worker processes (inter-process parallelism). The illustrative embodiments also provide an approach for decomposing the graph neighbor matching operations and the property projection operation into fine-grained configurable size tasks that can be processed independently by threads (intra-process parallelism) without the need for expensive synchronization primitives. For graph neighbor matching operations, a given set of source vertices is split into smaller tasks that are assigned to dedicated threads for processing. Each thread is responsible for computing a number of matching source vertices and propagating them to the next graph match operator for further processing. For property projection operations, the computed graph paths are organized into rows that contain the requested properties for each element of the path (vertices and/or edges).