中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

12 records (took 0.013 seconds)

    Learning property graph representations edge-by-edge
    1.
    发明授权
    Learning property graph representations edge-by-edge 有权

    公开(公告)号：US11205050B2

    公开(公告)日：2021-12-21

    申请号：US16179049

    申请日：2018-11-02

    Applicant: Oracle International Corporation

    Inventor： Rhicheek Patra ,  Sungpack Hong ,  Jinha Kim ,  Damien Hilloulin ,  Davide Bartolini ,  Hassan Chafi

    IPC: G06F40/30 ,  G06N20/10 ,  G06N3/04 ,  G06N3/08

    Abstract: Techniques are described herein for learning property graph representations edge-by-edge. In an embodiment, an input graph is received. The input graph comprises a plurality of vertices and a plurality of edges. Each vertex of the plurality of vertices is associated with vertex properties of the respective vertex. A vertex-to-property mapping is generated for each vertex of the plurality of vertices. The mapping maps each vertex to a vertex-property signature of a plurality of vertex-property signatures. A plurality of edge words is generated. Each edge word corresponds to one or more edges that each begin at a first vertex having a particular vertex-property signature of the plurality of vertex property signatures and end at a second vertex having a particular vertex-property signature of the plurality of vertex property signatures. A plurality of sentences is generated. Each sentence comprises edge words directly connected along a path of a plurality of paths in the input graph. Using the plurality of sentences and the plurality of edge words, a document vectorization model is used to generate machine learning vectors that represent the input graph.

    CATEGORICAL FEATURE ENCODING FOR PROPERTY GRAPHS BY VERTEX PROXIMITY
    2.
    发明申请
    CATEGORICAL FEATURE ENCODING FOR PROPERTY GRAPHS BY VERTEX PROXIMITY 审中-公开

    公开(公告)号：US20200257982A1

    公开(公告)日：2020-08-13

    申请号：US16270535

    申请日：2019-02-07

    Applicant: Oracle International Corporation

    Inventor： Jinha Kim ,  Rhicheek Patra ,  Sungpack Hong ,  Damien Hilloulin ,  Davide Bartolini ,  Hassan Chafi

    IPC: G06N3/08 ,  G06N3/04 ,  G06N5/04 ,  G06N20/10

    Abstract: Techniques are described herein for encoding categorical features of property graphs by vertex proximity. In an embodiment, an input graph is received. The input graph comprises a plurality of vertices, each vertex of said plurality of vertices is associated with vertex properties of said vertex. The vertex properties include at least one categorical feature value of one or more potential categorical feature values. For each of the one or more potential categorical feature values of each vertex, a numerical feature value is generated. The numerical feature value represents a proximity of the respective vertex to other vertices of the plurality of vertices that have a categorical feature value corresponding to the respective potential categorical feature value. Using the numerical feature values for each vertex, proximity encoding data is generated representing said input graph. The proximity encoding data is used to efficiently train machine learning models that produce results with enhanced accuracy.

    FAST GRAPH QUERY ENGINE OPTIMIZED FOR TYPICAL REAL-WORLD GRAPH INSTANCES WHOSE SMALL PORTION OF VERTICES HAVE EXTREMELY LARGE DEGREE
    3.
    发明申请
    FAST GRAPH QUERY ENGINE OPTIMIZED FOR TYPICAL REAL-WORLD GRAPH INSTANCES WHOSE SMALL PORTION OF VERTICES HAVE EXTREMELY LARGE DEGREE 有权

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

    FAST PROCESSING OF PATH-FINDING QUERIES IN LARGE GRAPH DATABASES
    5.
    发明申请
    FAST PROCESSING OF PATH-FINDING QUERIES IN LARGE GRAPH DATABASES 审中-公开
    在大型图形数据库中快速处理路径查找问题

    公开(公告)号：US20170060958A1

    公开(公告)日：2017-03-02

    申请号：US14837696

    申请日：2015-08-27

    Applicant: Oracle International Corporation

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

    IPC: G06F17/30

    Abstract: Techniques herein are for fast processing of path-finding queries in large graph databases. A computer system receives a graph search request to find a set of result paths between one or more source vertices of a graph and one or more target vertices of the graph. The graph comprises vertices connected by edges. During a first pass, the computer system performs one or more breadth-first searches to identify a subset of edges of the graph. The one or more breadth-first searches originate at the one or more source vertices. After the first pass and during a second pass, the computer system performs one or more depth-first searches to identify the set of result paths. The one or more depth-first searches originate at the one or more target vertices. The one or more depth-first searches traverse at most the subset of edges of the graph.

    Abstract translation: 这里的技术是用于在大图数据库中快速处理路径查找查询。 计算机系统接收图形搜索请求以找到图形的一个或多个源顶点与该图的一个或多个目标顶点之间的一组结果路径。 该图包括通过边缘连接的顶点。 在第一次通过期间，计算机系统执行一个或多个宽度优先搜索以识别图的边缘的子集。 一个或多个宽度优先搜索起源于一个或多个源顶点。 在第一次通过和第二遍之后，计算机系统执行一个或多个深度优先搜索以识别该组结果路径。 一个或多个深度优先搜索起始于一个或多个目标顶点。 一个或多个深度优先搜索最多遍历图形边缘的子集。

    Efficient method for subgraph pattern matching
    6.
    发明授权
    Efficient method for subgraph pattern matching 有权

    公开(公告)号：US10896223B2

    公开(公告)日：2021-01-19

    申请号：US16223805

    申请日：2018-12-18

    Applicant: Oracle International Corporation

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

    IPC: G06F16/90 ,  G06F16/901 ,  G06F16/22 ,  G06F16/28

    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.

    EFFICIENT METHOD FOR SUBGRAPH PATTERN MATCHING
    7.
    发明申请
    EFFICIENT METHOD FOR SUBGRAPH PATTERN MATCHING 审中-公开

    公开(公告)号：US20170169133A1

    公开(公告)日：2017-06-15

    申请号：US14969789

    申请日：2015-12-15

    Applicant: Oracle International Corporation

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

    IPC: G06F17/30

    CPC classification number: G06F17/30958 ,  G06F17/30324

    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.

    Fast processing of path-finding queries in large graph databases
    9.
    发明授权
    Fast processing of path-finding queries in large graph databases 有权

    公开(公告)号：US10810257B2

    公开(公告)日：2020-10-20

    申请号：US14837696

    申请日：2015-08-27

    Applicant: Oracle International Corporation

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

    IPC: G06F16/901

    Abstract: Techniques herein are for fast processing of path-finding queries in large graph databases. A computer system receives a graph search request to find a set of result paths between one or more source vertices of a graph and one or more target vertices of the graph. The graph comprises vertices connected by edges. During a first pass, the computer system performs one or more breadth-first searches to identify a subset of edges of the graph. The one or more breadth-first searches originate at the one or more source vertices. After the first pass and during a second pass, the computer system performs one or more depth-first searches to identify the set of result paths. The one or more depth-first searches originate at the one or more target vertices. The one or more depth-first searches traverse at most the subset of edges of the graph.

Patent Agency Ranking