公开(公告)号：US20180203897A1

公开(公告)日：2018-07-19

申请号：US15409091

申请日：2017-01-18

Applicant: ORACLE INTERNATIONAL CORPORATION

Inventor： Oskar Van Rest ,  Jinha Kim ,  Xuming Meng ,  Sungpack Hong ,  Hassan Chafi

IPC: G06F17/30

Abstract: Techniques herein accelerate graph querying by caching neighbor vertices (NVs) of super-node vertices. In an embodiment, a computer receives a graph query (GQ) to extract result paths from a graph in a database. The GQ has a sequence of query vertices (QVs) and a sequence of query edges (QEs). The computer successively traverses each QE and QV to detect paths of the graph that match the GQ. Traversing each QE and QV entails retrieving NVs of a current graph vertex (CGV) of a current traversal path. If the CGV is a key in a cache whose keys are graph vertices having an excessive degree, then the computer retrieves NVs from the cache. Otherwise, the computer retrieves NVs from the database. If the degree is excessive, and the CGV is not a key in the cache, then the computer stores, into the cache, the CGV as a key for the NVs.

公开(公告)号：US11256750B2

公开(公告)日：2022-02-22

申请号：US16540605

申请日：2019-08-14

Applicant: ORACLE INTERNATIONAL CORPORATION

Inventor： Oskar Van Rest ,  Jinha Kim ,  Xuming Meng ,  Sungpack Hong ,  Hassan Chafi

IPC: G06F16/00 ,  G06F16/901

Abstract: Techniques herein accelerate graph querying by caching neighbor vertices (NVs) of super-node vertices. In an embodiment, a computer receives a graph query (GQ) to extract result paths from a graph in a database. The GQ has a sequence of query vertices (QVs) and a sequence of query edges (QEs). The computer successively traverses each QE and QV to detect paths of the graph that match the GQ. Traversing each QE and QV entails retrieving NVs of a current graph vertex (CGV) of a current traversal path. If the CGV is a key in a cache whose keys are graph vertices having an excessive degree, then the computer retrieves NVs from the cache. Otherwise, the computer retrieves NVs from the database. If the degree is excessive, and the CGV is not a key in the cache, then the computer stores, into the cache, the CGV as a key for the NVs.

公开(公告)号：US10423663B2

公开(公告)日：2019-09-24

申请号：US15409091

申请日：2017-01-18

Applicant: ORACLE INTERNATIONAL CORPORATION

Inventor： Oskar Van Rest ,  Jinha Kim ,  Xuming Meng ,  Sungpack Hong ,  Hassan Chafi

IPC: G06F16/00 ,  G06F16/901

Abstract: Techniques herein accelerate graph querying by caching neighbor vertices (NVs) of super-node vertices. In an embodiment, a computer receives a graph query (GQ) to extract result paths from a graph in a database. The GQ has a sequence of query vertices (QVs) and a sequence of query edges (QEs). The computer successively traverses each QE and QV to detect paths of the graph that match the GQ. Traversing each QE and QV entails retrieving NVs of a current graph vertex (CGV) of a current traversal path. If the CGV is a key in a cache whose keys are graph vertices having an excessive degree, then the computer retrieves NVs from the cache. Otherwise, the computer retrieves NVs from the database. If the degree is excessive, and the CGV is not a key in the cache, then the computer stores, into the cache, the CGV as a key for the NVs.