知搜-全球专利检索

  1. Login
  2. Sign Up

Search Results

194 records (took 0.028 seconds)

    Deterministic semantic for graph property update queries and its efficient implementation
    151.
    发明授权
    Deterministic semantic for graph property update queries and its efficient implementation 有权

    公开(公告)号：US11928097B2

    公开(公告)日：2024-03-12

    申请号：US17479006

    申请日：2021-09-20

    Applicant: Oracle International Corporation

    Inventor： Bence Czipo ,  Vlad Ioan Haprian ,  Oskar Van Rest ,  Damien Hilloulin ,  Vasileios Trigonakis ,  Yahya Ez-zainabi ,  Sungpack Hong ,  Hassan Chafi

    IPC: G06F16/23 ,  G06F11/07

    CPC classification number: G06F16/2315 ,  G06F11/0772 ,  G06F16/2365

    Abstract: Efficiently implemented herein is a deterministic semantic for property updates by graph queries. Mechanisms of determinism herein ensure data consistency for graph mutation. These mechanisms facilitate optimistic execution of graph access despite a potential data access conflict. This approach may include various combinations of special activities such as detecting potential conflicts during query compile time, applying query transformations to eliminate those conflicts during code generation where possible, and executing updates in an optimistic way that safely fails if determinism cannot be guaranteed. In an embodiment, a computer receives a request to modify a graph. The request to modify the graph is optimistically executed after preparation and according to safety precautions as presented herein. Based on optimistically executing the request, a data access conflict actually occurs and is automatically detected. Based on the data access conflict, optimistically executing the request is prematurely and automatically halted without finishing executing the request.

    N-1 EXPERTS: MODEL SELECTION FOR UNSUPERVISED ANOMALY DETECTION
    152.
    发明公开
    N-1 EXPERTS: MODEL SELECTION FOR UNSUPERVISED ANOMALY DETECTION 审中-公开

    公开(公告)号：US20230334364A1

    公开(公告)日：2023-10-19

    申请号：US18075667

    申请日：2022-12-06

    Applicant: Oracle International Corporation

    Inventor： Yasha Pushak ,  Robert Wayne Harlow ,  Constantin Le Clei ,  Hesam Fathi Moghadam ,  Sungpack Hong ,  Hassan Chafi

    IPC: G06N20/00

    CPC classification number: G06N20/00

    Abstract: In an embodiment in a computer, each of several anomaly detectors infers a respective anomaly inference for each of many test tuples. For each available anomaly detector that is not the candidate anomaly detector, a respective fitness score is measured for the candidate anomaly detector that indicates how similar are anomaly inferences of the candidate anomaly detector to anomaly inferences of the available anomaly detector. Fitness scores of the candidate anomaly detector are combined into a combined fitness score for the candidate anomaly detector. The best anomaly detector that has a highest combined fitness score is selected for further operation such as inferring an anomaly inference for a new tuple while retraining or in production.

    Named entity disambiguation using entity distance in a knowledge graph
    154.
    发明授权
    Named entity disambiguation using entity distance in a knowledge graph 有权

    公开(公告)号：US11526673B2

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

    申请号：US17153078

    申请日：2021-01-20

    Applicant: Oracle International Corporation

    Inventor： Rhicheek Patra ,  Davide Bartolini ,  Sungpack Hong ,  Hassan Chafi ,  Alberto Parravicini

    IPC: G06F40/295 ,  G06N5/02

    Abstract: According to an embodiment, a method includes converting a knowledge base into a graph. In this embodiment, the knowledge base contains a plurality of entities and specifies a plurality of relationships among the plurality of entities, and entities in the knowledge base correspond to vertices in the graph, and relationships between entities in the knowledge base correspond to edges between vertices in the graph. The method may also include extracting a plurality of vertex embeddings from the graph. An example vertex embedding of the plurality of vertex embeddings represents, for a particular vertex, a proximity of the particular vertex to other vertices of the graph. Further, the method may include performing, based at least in part on the plurality of vertex embeddings, entity linking between input text and the knowledge base.

    Defining subgraphs declaratively with vertex and edge filters
    156.
    发明授权
    Defining subgraphs declaratively with vertex and edge filters 有权

    公开(公告)号：US11294899B2

    公开(公告)日：2022-04-05

    申请号：US16548687

    申请日：2019-08-22

    Applicant: Oracle International Corporation

    Inventor： Alexander Weld ,  Korbinian Schmid ,  Sungpack Hong ,  Hassan Chafi ,  Hyungyu Shin

    IPC: G06F17/30 ,  G06F16/2453 ,  G06F16/248 ,  G06F16/25 ,  G06F16/901 ,  G06F16/27

    Abstract: Techniques herein optimally distribute graph query processing across heterogeneous tiers. In an embodiment, a computer receives a graph query to extract a query result (QR) from a graph in a database operated by a database management system (DBMS). The graph has vertices interconnected by edges. Each vertex has vertex properties, and each edge has edge properties. The computer decomposes the graph query into filter expressions (FE's). Each FE is processed as follows. A filtration tier to execute the FE is selected from: the DBMS which sends at least the QR to a stream, a stream evaluator that processes the stream as it arrives without waiting for the entire QR to arrive and that stores at least the QR into memory, and an in-memory evaluator that identifies the QR in memory. A translation of the FE executes on the filtration tier to obtain vertices and/or edges that satisfy the FE.

    Optimizing graph queries by performing early pruning
    158.
    发明授权
    Optimizing graph queries by performing early pruning 有权

    公开(公告)号：US11250059B2

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

    申请号：US16738972

    申请日：2020-01-09

    Applicant: ORACLE INTERNATIONAL CORPORATION

    Inventor： Arnaud Delamare ,  Vasileios Trigonakis ,  Jean-Pierre Lozi ,  Vlad Ioan Haprian ,  Petr Koupy ,  Hassan Chafi ,  Sungpack Hong

    IPC: G06F16/00 ,  G06F16/901 ,  G06F16/2453 ,  G06F16/903 ,  G06F16/9032

    Abstract: Techniques are described herein for early pruning of potential graph query results. Specifically, based on determining that property values of a path through graph data cannot affect results of a query, the path is pruned from a set of potential query solutions prior to fully exploring the path. Early solution pruning is performed on prunable queries that project prunable functions including MIN, MAX, SUM, and DISTINCT, the results of which are not tied to a number of paths explored for query execution. A database system implements early solution pruning for a prunable query based on intermediate results maintained for the query during query execution. Specifically, when a system determines that property values of a given potential solution path cannot affect the query results reflected in intermediate results maintained for the query, the path is discarded from the set of possible query solutions without further exploration of the path.

    METHOD FOR SHARING LANDMARKS FOR FAST PROCESSING OF TOP K CHEAPEST PATH QUERIES
    159.
    发明申请
    METHOD FOR SHARING LANDMARKS FOR FAST PROCESSING OF TOP K CHEAPEST PATH QUERIES 有权

    公开(公告)号：US20210209108A1

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

    申请号：US16734035

    申请日：2020-01-03

    Applicant: Oracle International Corporation

    Inventor： Vlad Haprian ,  Oskar Van Rest ,  Sungpack Hong ,  Hassan Chafi ,  Bence Czipo

    IPC: G06F16/2453 ,  G06F16/22

    Abstract: Herein are techniques to accelerate finding a top few shortest paths between two vertices of a graph. In an embodiment, a computer calculates, for a graph that contains vertices that include landmark vertices, distances between each vertex and each landmark vertex. Based on the distances from each vertex to each landmark vertex, a top few shortest paths from a source vertex to a target vertex are calculated. In an embodiment, triangulation establishes a lower bound on a distance from a neighbor vertex of a current vertex to a target vertex of a query. In an embodiment, distance predictions based on the distance lower bounds are used to accelerate a K-A star search for the top few shortest paths.

    Concurrent distributed graph processing system with self-balance
    160.
    发明授权
    Concurrent distributed graph processing system with self-balance 有权

    公开(公告)号：US11030014B2

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

    申请号：US16270135

    申请日：2019-02-07

    Applicant: Oracle International Corporation

    Inventor： Thomas Manhardt ,  Sungpack Hong ,  Siegfried Depner ,  Jinsu Lee ,  Nicholas Roth ,  Hassan Chafi

    IPC: G06F9/50 ,  H04L29/08 ,  G06F9/52 ,  G06F16/901 ,  G06F11/34

    Abstract: Techniques are provided for dynamically self-balancing communication and computation. In an embodiment, each partition of application data is stored on a respective computer of a cluster. The application is divided into distributed jobs, each of which corresponds to a partition. Each distributed job is hosted on the computer that hosts the corresponding data partition. Each computer divides its distributed job into computation tasks. Each computer has a pool of threads that execute the computation tasks. During execution, one computer receives a data access request from another computer. The data access request is executed by a thread of the pool. Threads of the pool are bimodal and may be repurposed between communication and computation, depending on workload. Each computer individually detects completion of its computation tasks. Each computer informs a central computer that its distributed job has finished. The central computer detects when all distributed jobs of the application have terminated.

Patent Agency Ranking