中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

28 records (took 0.019 seconds)

    Space-efficient methodology for representing label information in large graph data for fast distributed graph query
    21.
    发明授权
    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.

    Exploiting Intra-Process And Inter-Process Parallelism To Accelerate In-Memory Processing Of Graph Queries In Relational Databases
    22.
    发明申请
    Exploiting Intra-Process And Inter-Process Parallelism To Accelerate In-Memory Processing Of Graph Queries In Relational Databases 有权

    公开(公告)号：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).

Patent Agency Ranking