知搜-全球专利检索

  1. Login
  2. Sign Up

Search Results

11 records (took 0.013 seconds)

    METHOD FOR SHARING LANDMARKS FOR FAST PROCESSING OF TOP K CHEAPEST PATH QUERIES
    4.
    发明申请
    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.

    Reachability graph index for query processing
    7.
    发明授权
    Reachability graph index for query processing 有权

    公开(公告)号：US10942970B2

    公开(公告)日：2021-03-09

    申请号：US16159384

    申请日：2018-10-12

    Applicant: Oracle International Corporation

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

    IPC: G06F7/00 ,  G06F16/00 ,  G06F16/901 ,  G06F16/903

    Abstract: Techniques are described for generating and re-using reachability graphs for efficient execution of queries. In an embodiment, a query is received for execution on a data graph. Such a query may include one or more expressions for edges in the data graph, which when executed select one or more paths in the data graph to generate results for the query. The system uses a repository to store reachability graphs and may determine whether a reachability graph for an expression of the query for the data graph is stored in a repository. Such a reachability graph is generated by applying the expression on the data graph to qualify or disqualify the edges in the data graph to be included as part of edges of the reachability graph. For example, an edge in a reachability graph exists between two vertices when at least one edge of the data graph has qualified between two vertices of the data graph that correspond to the two vertices of the reachability graph. Based on determining that the reachability graph for the expression is stored in the repository, the system executes the query on the reachability graph without re-applying the expression on the data graph and generates the results for the query.

Patent Agency Ranking