中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

58 records (took 0.045 seconds)

    Two-valued logic primitives for SQL query processing
    13.
    发明授权
    Two-valued logic primitives for SQL query processing 有权

    公开(公告)号：US11269874B2

    公开(公告)日：2022-03-08

    申请号：US16823632

    申请日：2020-03-19

    Applicant: Oracle International Corporation

    Inventor： Pit Fender ,  Benjamin Schlegel ,  Alexander Ulrich

    IPC: G06F16/245 ,  G06F16/2453

    Abstract: The present invention relates to data manipulation language (DML) acceleration. Herein are database techniques to use value range analysis and range-limited execution operators when a value is excluded. In an embodiment, a computer receives a data access request that specifies an expression that includes operator(s), including a particular operator that has argument(s) that has only three possible values. Before detecting the actual value of a particular argument, the computer detects that a particular value of the three possible values is excluded for the particular argument. Responsively, an implementation of the particular operator that never accepts the particular value for the particular argument is selected. Applying the expression to fulfil the data access request entails invoking the selected implementation of the particular operator.

    VECTORIZED QUEUES FOR SHORTEST-PATH GRAPH SEARCHES
    15.
    发明申请
    VECTORIZED QUEUES FOR SHORTEST-PATH GRAPH SEARCHES 有权

    公开(公告)号：US20210271711A1

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

    申请号：US16803832

    申请日：2020-02-27

    Applicant: Oracle International Corporation

    Inventor： Benjamin Schlegel ,  Martin Sevenich ,  Pit Fender ,  Matthias Brantner ,  Hassan Chafi

    IPC: G06F16/901 ,  G06F9/54 ,  G06F9/38

    Abstract: Techniques are described for a vectorized queue, which implements a vectorized ‘contains’ function that determines whether a value is in the queue. A three-phase vectorized shortest-path graph search splits each expanding and probing iteration into three phases that utilize vectorized instructions: (1) The neighbors of nodes that are in a next queue are fetched and written into a current queue. (2) It is determined whether the destination node is among the fetched neighbor nodes in the current queue. (3) The fetched neighbor nodes that have not yet been visited are put into the next queue. According to an embodiment, a vectorized copy operation performs vector-based data copying using vectorized load and store instructions. Specifically, vectors of data are copied from a source to a destination. Any invalid data copied to the destination is overwritten, either with a vector of additional valid data or with a vector of nonce data.

    Non-disruptive referencing of special purpose operators for database management systems
    16.
    发明授权
    Non-disruptive referencing of special purpose operators for database management systems 有权

    公开(公告)号：US10990596B2

    公开(公告)日：2021-04-27

    申请号：US16442015

    申请日：2019-06-14

    Applicant: Oracle International Corporation

    Inventor： Pit Fender ,  Benjamin Schlegel ,  Matthias Brantner

    IPC: G06F16/2453 ,  G06F16/28

    Abstract: Approaches herein transparently delegate data access from a relational database management system (RDBMS) onto an offload engine (OE). The RDBMS receives a database statement referencing a user defined function (UDF). In an execution plan, the RDBMS replaces the UDF reference with an invocation of a relational operator in the OE. Execution invokes the relational operator in the OE to obtain a result based on data in the OE. Thus, the UDF is bound to the OE, and almost all of the RDBMS avoids specially handling the UDF. The UDF may be a table function that offloads a relational table for processing. User defined objects such as functions and types provide metadata about the table. Multiple tables can be offloaded and processed together, such that some or all offloaded tables are not materialized in the RDBMS. Offloaded tables may participate in standard relational algebra such as in a database statement.

    INFLUENCING PLAN GENERATION IN THE CONTEXT OF THE TWO PHASE QUERY OPTIMIZATION APPROACH
    17.
    发明申请
    INFLUENCING PLAN GENERATION IN THE CONTEXT OF THE TWO PHASE QUERY OPTIMIZATION APPROACH 有权

    公开(公告)号：US20210026855A1

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

    申请号：US16519794

    申请日：2019-07-23

    Applicant: Oracle International Corporation

    Inventor： Pit Fender ,  Benjamin Schlegel ,  Nipun Agarwal

    IPC: G06F16/2453

    Abstract: Techniques are described herein for influencing plan generation in context of the two phase query optimization approach. Types of pruning criteria including method pruning criteria, total cost pruning criteria, and permutation pruning criteria exist in cost-based plan generators to determine what parts of a query statement should be offloaded to a query offload engine. Method pruning criteria is responsible to determine an optimal joining method. Total cost pruning criteria compares accumulated costs with a lowest plan cost determined so far. Permutation pruning criteria is responsible for selecting the cheapest query execution plan from all considered query execution plans. Each type of pruning criteria is modified to favor offload engine execution upon request.

Patent Agency Ranking