知搜-全球专利检索

  1. Login
  2. Sign Up

Search Results

36 records (took 0.027 seconds)

    ACCESS-FREQUENCY-BASED ENTITY REPLICATION TECHNIQUES FOR DISTRIBUTED PROPERTY GRAPHS WITH SCHEMA
    31.
    发明公开
    ACCESS-FREQUENCY-BASED ENTITY REPLICATION TECHNIQUES FOR DISTRIBUTED PROPERTY GRAPHS WITH SCHEMA 审中-公开

    公开(公告)号：US20230281219A1

    公开(公告)日：2023-09-07

    申请号：US17686938

    申请日：2022-03-04

    Applicant: Oracle International Corporation

    Inventor： Jinsu Lee ,  Petr Koupy ,  Vasileios Trigonakis ,  Sungpack Hong ,  Hassan Chafi

    IPC: G06F16/27 ,  G06F16/28 ,  G06F16/22

    CPC classification number: G06F16/27 ,  G06F16/284 ,  G06F16/2282

    Abstract: In an embodiment, multiple computers cooperate to retrieve content from tables in a relational database. Each table contains respective rows. Each row contains a vertex of a graph. Many high-degree vertices are identified. Each high-degree vertex is connected to respective edges in the graph. A count of the edges of each high-degree vertex exceeds a degree threshold. A central computer detects that all vertices in a high-degree subset of tables are high-degree vertices. Based on detecting the high-degree subset of tables, multiple vertices of the graph that are not in the high-degree subset of tables are replicated. Within local storage capacity limits of the computers, this degree-based replication may be supplemented with other vertex replication strategies that are schema based, content based, or workload based. This intelligent selective replication maximizes system throughput by minimizing graph data access latency based on data locality.

    FAST AND MEMORY-EFFICIENT DISTRIBUTED GRAPH MUTATIONS
    32.
    发明公开
    FAST AND MEMORY-EFFICIENT DISTRIBUTED GRAPH MUTATIONS 审中-公开

    公开(公告)号：US20230237047A1

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

    申请号：US17585117

    申请日：2022-01-26

    Applicant: Oracle International Corporation

    Inventor： Vasileios Trigonakis ,  Paul Renauld ,  Jinsu Lee ,  Petr Koupy ,  Sungpack Hong ,  Hassan Chafi

    IPC: G06F16/23 ,  G06F16/901

    CPC classification number: G06F16/2379 ,  G06F16/9024

    Abstract: Data structures and methods are described for applying mutations on a distributed graph in a fast and memory-efficient manner. Nodes in a distributed graph processing system may store graph information such as vertices, edges, properties, vertex keys, vertex degree counts, and other information in graph arrays, which are divided into shared arrays and delta logs. The shared arrays on a local node remain immutable and are the starting point of a graph, on top of which mutations build new snapshots. Mutations may be supported at both the entity and table levels. Periodic delta log consolidation may occur at multiple levels to prevent excessive delta log buildup. Consolidation at the table level may also trigger rebalancing of vertices across the nodes.

    DUPLICATION ELIMINATION IN DEPTH BASED SEARCHES FOR DISTRIBUTED SYSTEMS
    34.
    发明申请
    DUPLICATION ELIMINATION IN DEPTH BASED SEARCHES FOR DISTRIBUTED SYSTEMS 有权

    公开(公告)号：US20220179859A1

    公开(公告)日：2022-06-09

    申请号：US17116831

    申请日：2020-12-09

    Applicant: Oracle International Corporation

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

    IPC: G06F16/2452 ,  G06F16/2455 ,  G06F16/248

    Abstract: Systems and methods for improving evaluation of graph queries through depth first traversals are described herein. In an embodiment, a multi-node system evaluates against graph data a graph query that specifies a particular pattern to match by determining, at a first node of the multi-node system, in a particular instance of evaluating the graph query, that one or more first vertices on the first node match a first portion of the graph query and that a second vertex that is to be evaluated next is stored on a second node separate from the first node. In response to determining that the next vertex to be evaluated is stored on the second node separate from the first node, the first node generates a message to the second node comprising one or more results of the first portion of the graph query based on the one or more first vertices, an identifier of the next vertex, and a current stage of evaluating the graph query. In response to generating the message from the first node to the second node, the first node ceases the particular instance of evaluating the graph query.

Patent Agency Ranking