公开(公告)号：US20220114178A1

公开(公告)日：2022-04-14

申请号：US17162564

申请日：2021-01-29

Applicant: Oracle International Corporation

Inventor： Vlad Ioan Haprian ,  Mikael Gonzalez Morales ,  Laurent Daynes ,  Zhen Hua Liu ,  Danica Porobic ,  Marco Arnaboldi ,  Jean-Pierre Lozi ,  Hugo Kapp ,  Sungpack Hong ,  Shasank Kisan Chavan ,  Hassan Chafi

IPC: G06F16/2455 ,  G06F16/26 ,  G06F16/2453 ,  G06F16/248 ,  G06F16/22

Abstract: Techniques are provided for processing a graph query by exploiting an in-memory graph index and minimizing the number of storage accesses needed to project properties of generated paths. A predefined number of paths from a graph query runtime is accumulated, using different data structures, before executing storage accesses necessary to retrieve all properties needed. A first data structure stores all paths from the graph query runtime that hit cache(s) entirely. A second data structure stores paths that do not hit caches at any level or only a subset of the levels does. Once any of these data structures are full, result rows are produced based on the two data structures prior to extracting more paths from the graph query runtime.

公开(公告)号：US11093459B2

公开(公告)日：2021-08-17

申请号：US16747827

申请日：2020-01-21

Applicant: Oracle International Corporation

Inventor： Marco Arnaboldi ,  Jean-Pierre Lozi ,  Laurent Phillipe Daynes ,  Vlad Ioan Haprian ,  Shasank Kisan Chavan ,  Hugo Kapp ,  Sungpack Hong

IPC: G06F16/30 ,  G06F7/00 ,  G06F16/21 ,  G06F16/27 ,  G06F16/28 ,  G06F16/901

Abstract: Herein are techniques that concurrently populate entries in a compressed sparse row (CSR) encoding, of a type of edge of a heterogenous graph. In an embodiment, a computer obtains a mapping of a relational schema to a graph data model. The relational schema defines vertex tables that correspond to vertex types in the graph data model, and edge tables that correspond to edge types in the graph data model. Each edge type is associated with a source vertex type and a target vertex type. For each vertex type, a sequence of persistent identifiers of vertices is obtained. Based on the mapping and for a CSR representation of each edge type, a source array is populated that, for a same vertex ordering as the sequence of persistent identifiers for the source vertex type, is based on counts of edges of the edge type that originate from vertices of the source vertex type. For the CSR, the computer populates, in parallel and based on said mapping, a destination array that contains canonical offsets as sequence positions within the sequence of persistent identifiers of the vertices.