-
公开(公告)号:US20190121825A1
公开(公告)日:2019-04-25
申请号:US16223805
申请日:2018-12-18
Applicant: Oracle International Corporation
Inventor: Jinha Kim , Oskar Van Rest , Sungpack Hong , Hassan Chafi
IPC: G06F16/901 , G06F16/22
Abstract: Techniques herein optimize subgraph pattern matching. A computer receives a graph vertex array and a graph edge array. Each vertex and each edge has labels. The computer stores an array of index entries and an array of edge label sets. Each index entry corresponds to a respective vertex originating an edge and associates an offset of the edge with an offset of the respective vertex. Each edge label set contains labels of a respective edge. The computer selects a candidate subset of edges originating at a current vertex. The edge labels of each candidate edge of the candidate subset include a same particular query edge labels. The computer selects the candidate subset based on the index array and afterwards selects a result subset of vertices from among the terminating vertices of the candidate edges. The labels of each vertex of the result subset include a same particular query vertex labels.
-
公开(公告)号:US10204174B2
公开(公告)日:2019-02-12
申请号:US14969789
申请日:2015-12-15
Applicant: Oracle International Corporation
Inventor: Jinha Kim , Oskar Van Rest , Sungpack Hong , Hassan Chafi
IPC: G06F17/30
Abstract: Techniques herein optimize subgraph pattern matching. A computer receives a graph vertex array and a graph edge array. Each vertex and each edge has labels. The computer stores an array of index entries and an array of edge label sets. Each index entry corresponds to a respective vertex originating an edge and associates an offset of the edge with an offset of the respective vertex. Each edge label set contains labels of a respective edge. The computer selects a candidate subset of edges originating at a current vertex. The edge labels of each candidate edge of the candidate subset include a same particular query edge labels. The computer selects the candidate subset based on the index array and afterwards selects a result subset of vertices from among the terminating vertices of the candidate edges. The labels of each vertex of the result subset include a same particular query vertex labels.
-