知搜-全球专利检索

  1. Login
  2. Sign Up

Search Results

213 records (took 0.027 seconds)

    First futamura projection in the context of SQL expression evaluation
    83.
    发明授权
    First futamura projection in the context of SQL expression evaluation 有权

    公开(公告)号：US11461324B2

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

    申请号：US16555974

    申请日：2019-08-29

    Applicant: Oracle International Corporation

    Inventor： Pit Fender ,  Alexander Ulrich ,  Laurent Daynes ,  Matthias Brantner ,  Bastian Hossbach ,  Benjamin Schlegel ,  Hassan Chafi

    IPC: G06F16/24 ,  G06F16/2453 ,  G06F16/2455 ,  G06F8/41

    Abstract: The present invention relates to execution optimization of database queries. Herein are techniques for optimal execution based on query interpretation by translation to a domain specific language (DSL), with optimizations such as partial evaluation, abstract syntax tree (AST) rewriting, just in time (JIT) compilation, dynamic profiling, speculative logic, and Futamura projection. In an embodiment, a database management system (DBMS) that is hosted on a computer generates a query tree that represents a database query that contains an expression that is represented by a subtree of the query tree. The DBMS generates a sequence of DSL instructions that represents the subtree. The sequence of DSL instructions is executed to evaluate the expression during execution of the database query. In an embodiment, an AST is generated from the sequence of DSL instructions. In an embodiment, the DSL AST is optimally rewritten based on a runtime feedback loop that includes dynamic profiling information.

    Method for applying graph-specific compiler optimizations to graph analysis programs
    84.
    发明授权
    Method for applying graph-specific compiler optimizations to graph analysis programs 有权

    公开(公告)号：US11379200B2

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

    申请号：US16776792

    申请日：2020-01-30

    Applicant: Oracle International Corporation

    Inventor： Martijn Dwars ,  Martin Sevenich ,  Sungpack Hong ,  Hassan Chafi ,  Guido Wachsmuth

    IPC: G06F8/41 ,  G06F8/34 ,  G06F8/72 ,  G06F9/30 ,  G06F9/54

    Abstract: Techniques are described for compiling source code to generate graph-optimized intermediate representation instructions of the source code that implement techniques for optimizing algorithms for graph analysis. A compiler, executing on a computing device, receives source code instructions for a program to be compiled. The compiler identifies a target expression, within the source code instructions, that invokes a particular method call on a particular object type. The target expression contains a target block of code to be translated into an intermediate representation using graph-optimized compilation techniques. The compiler generates a block of graph-specific intermediate representation instructions to replace the target expression. The compiler compiles the source code instructions to generate intermediate representation instructions, where the intermediate representation instructions include the block of graph-specific intermediate representation instructions in place of the target expression.

    Learning property graph representations edge-by-edge
    86.
    发明授权
    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.

    DYNAMIC ASYNCHRONOUS TRAVERSALS FOR DISTRIBUTED GRAPH QUERIES
    87.
    发明申请
    DYNAMIC ASYNCHRONOUS TRAVERSALS FOR DISTRIBUTED GRAPH QUERIES 有权

    公开(公告)号：US20210240705A1

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

    申请号：US16778668

    申请日：2020-01-31

    Applicant: ORACLE INTERNATIONAL CORPORATION

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

    IPC: G06F16/2452 ,  G06F16/2458

    Abstract: Techniques are described for enabling in-memory execution of any-sized graph data query by utilizing both depth first search (DFS) principles and breadth first search (BFS) principles to control the amount of memory used during query execution. Specifically, threads implementing a graph DBMS switch between a BFS mode of data traversal and a DFS mode of data traversal. For example, when a thread detects that there are less than a configurable threshold number of intermediate results in memory, the thread enters BFS-based traversal techniques to increase the number of intermediate results in memory. When the thread detects that there are at least the configurable threshold number of intermediate results in memory, the thread enters DFS mode to produce final results, which generally works to move the intermediate results that are currently available in memory to final query results, thereby reducing the number of intermediate results in memory.

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

    NAMED ENTITY DISAMBIGUATION USING ENTITY DISTANCE IN A KNOWLEDGE GRAPH
    89.
    发明申请
    NAMED ENTITY DISAMBIGUATION USING ENTITY DISTANCE IN A KNOWLEDGE GRAPH 有权

    公开(公告)号：US20210142008A1

    公开(公告)日：2021-05-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.

    Reachability graph index for query processing
    90.
    发明授权
    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