知搜-全球专利检索

  1. Login
  2. Sign Up

Search Results

39 records (took 0.019 seconds)

    Fast in-memory technique to build a reverse CSR graph index in an RDBMS
    15.
    发明授权
    Fast in-memory technique to build a reverse CSR graph index in an RDBMS 有权

    公开(公告)号：US11537579B2

    公开(公告)日：2022-12-27

    申请号：US16816686

    申请日：2020-03-12

    Applicant: Oracle International Corporation

    Inventor： Jean-Pierre Lozi ,  Marco Arnaboldi ,  Laurent Phillipe Daynes ,  Vlad Ioan Haprian ,  Hugo Kapp

    IPC: G06F16/22 ,  G06F16/21

    Abstract: In an embodiment, a computer obtains a mapping of a relational schema of a database to a graph data model. The relational schema identifies vertex table(s) that correspond to vertex type(s) in the graph data model and edge table(s) that correspond to edge type(s) in the graph data model. Each edge type is associated with a source vertex type and a target vertex type. Based on that mapping, a forward compressed sparse row (CSR) representation is populated for forward traversal of edges of a same edge type. Each edge originates at a source vertex and terminates at a target vertex. Based on the forward CSR representation, a reverse CSR representation of the edge type is populated for reverse traversal of the edges of the edge type. Acceleration occurs in two ways. Values calculated for the forward CSR are reused for the reverse CSR. Elastic and inelastic scaling may occur.

    PARALLEL AND EFFICIENT TECHNIQUE FOR BUILDING AND MAINTAINING A MAIN MEMORY CSR BASED GRAPH INDEX IN A RDBMS
    17.
    发明申请
    PARALLEL AND EFFICIENT TECHNIQUE FOR BUILDING AND MAINTAINING A MAIN MEMORY CSR BASED GRAPH INDEX IN A RDBMS 有权

    公开(公告)号：US20210334249A1

    公开(公告)日：2021-10-28

    申请号：US17370418

    申请日：2021-07-08

    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/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.

    DYNAMIC ASYNCHRONOUS TRAVERSALS FOR DISTRIBUTED GRAPH QUERIES
    18.
    发明申请
    DYNAMIC ASYNCHRONOUS TRAVERSALS FOR DISTRIBUTED GRAPH QUERIES 有权

    公开(公告)号：US20210240705A1

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

    申请号：US16778668

    申请日：2020-01-31

    Applicant: ORACLE INTERNATIONAL CORPORATION

    Inventor： Vasileios Trigonakis ,  Tomas Faltin ,  Jean-Pierre Lozi ,  Vlad Ioan Haprian ,  Sungpack Hong ,  Hassan Chafi

    IPC: G06F16/2452 ,  G06F16/2458

    Abstract: Techniques are described for enabling in-memory execution of any-sized graph data query by utilizing both depth first search (DFS) principles and breadth first search (BFS) principles to control the amount of memory used during query execution. Specifically, threads implementing a graph DBMS switch between a BFS mode of data traversal and a DFS mode of data traversal. For example, when a thread detects that there are less than a configurable threshold number of intermediate results in memory, the thread enters BFS-based traversal techniques to increase the number of intermediate results in memory. When the thread detects that there are at least the configurable threshold number of intermediate results in memory, the thread enters DFS mode to produce final results, which generally works to move the intermediate results that are currently available in memory to final query results, thereby reducing the number of intermediate results in memory.

    Space-efficient methodology for representing label information in large graph data for fast distributed graph query
    19.
    发明授权
    Space-efficient methodology for representing label information in large graph data for fast distributed graph query 有权

    公开(公告)号：US11074260B2

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

    申请号：US16378424

    申请日：2019-04-08

    Applicant: Oracle International Corporation

    Inventor： Arnaud Delamare ,  Vasileios Trigonakis ,  Vlad Ioan Haprian ,  Oskar Van Rest ,  Sungpack Hong ,  Hassan Chafi ,  Tomas Faltin ,  Jean-Pierre Lozi

    IPC: G06F16/00 ,  G06F16/2453 ,  G06F16/901 ,  G06F16/22 ,  H03M7/40 ,  H03M7/30

    Abstract: Techniques are described herein for space-efficient encoding of label information of property graphs. In an embodiment, an input graph is received. The input graph comprises a plurality of entities and a plurality of label sets. Each entity of said plurality of entities is associated with a label set of the plurality of label sets and each label set of the plurality of label sets comprises zero or more labels of a plurality of labels. A first mapping is generated that maps each label of the plurality of labels to a label code. A second mapping is generated that maps each label integer set of a plurality of label integer sets to a label code. Each label integer set of the plurality of label integer sets corresponds to a label set of the plurality of label sets, wherein each label integer set of the plurality of label integer sets comprises label codes from the first mapping that are mapped to each label included in the corresponding label set. A compressed label set is generated for each entity of the plurality of entities. Each compressed label set comprises a plurality of bits that indicate a zeroth state, a first state, a second state, or a third state. The compressed label sets and the first and second mappings are used to efficiently evaluate graph label queries.

Patent Agency Ranking