中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

58 records (took 0.024 seconds)

    Complete, correct and fast compile-time encoding inference on the basis of an underlying type system
    41.
    发明授权
    Complete, correct and fast compile-time encoding inference on the basis of an underlying type system 有权

    公开(公告)号：US10685021B2

    公开(公告)日：2020-06-16

    申请号：US15791696

    申请日：2017-10-24

    Applicant: Oracle International Corporation

    Inventor： Pit Fender ,  Sam Idicula ,  Nipun Agarwal ,  Benjamin Schlegel

    IPC: G06F16/00 ,  G06F16/2453 ,  G06F8/41

    Abstract: Techniques are described herein for introducing transcode operators into a generated operator tree during query processing. Setting up the transcode operators with correct encoding type at runtime is performed by inferring correct encoding type information during compile time. The inference of the correct encoding type information occurs in three phases during compile time: the first phase involves collecting, consolidating, and propagating the encoding-type information of input columns up the expression tree. The second phase involves pushing the encoding-type information down the tree for nodes in the expression tree that do not yet have any encoding-type assigned. The third phase involves determining which inputs to the current relational operator need to be pre-processed by a transcode operator.

    Non-disruptive dynamic ad-hoc database catalog services
    42.
    发明授权
    Non-disruptive dynamic ad-hoc database catalog services 有权

    公开(公告)号：US12050602B2

    公开(公告)日：2024-07-30

    申请号：US17505741

    申请日：2021-10-20

    Applicant: Oracle International Corporation

    Inventor： Pit Fender ,  Benjamin Schlegel ,  Matthias Brantner

    IPC: G06F16/2453 ,  G06F16/21 ,  G06F16/28

    CPC classification number: G06F16/24542 ,  G06F16/212 ,  G06F16/284

    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.

    Vectorized queues for shortest-path graph searches
    43.
    发明授权
    Vectorized queues for shortest-path graph searches 有权

    公开(公告)号：US11630864B2

    公开(公告)日：2023-04-18

    申请号：US16803832

    申请日：2020-02-27

    Applicant: Oracle International Corporation

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

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

    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.

    Driving massive scale out through rewrites of analytical functions
    45.
    发明授权
    Driving massive scale out through rewrites of analytical functions 有权

    公开(公告)号：US11455303B2

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

    申请号：US16516898

    申请日：2019-07-19

    Applicant: Oracle International Corporation

    Inventor： Pit Fender ,  Benjamin Schlegel ,  Matthias Brantner

    IPC: G06F16/245 ,  G06F16/2453 ,  G06F16/2455

    Abstract: According to an embodiment, a method includes rewriting a particular query to generate a rewritten query. The particular query specifies a window function operator, a particular input to the window function operator, and an analytical function. Rewriting the particular query includes assigning the particular input to an intermediate relation and replacing the window function operator with a replacement operator. The method further includes assigning to the replacement operator an aggregate function corresponding to the analytical function, and the intermediate relation. In this embodiment, the method also includes placing a join operator that joins the intermediate relation with an output of the replacement operator.

    Inferring intra package and module dependencies
    47.
    发明授权
    Inferring intra package and module dependencies 有权

    公开(公告)号：US11385889B2

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

    申请号：US16703499

    申请日：2019-12-04

    Applicant: Oracle International Corporation

    Inventor： Pit Fender ,  Benjamin Schlegel ,  Matthias Brantner ,  Harshad Kasture ,  Hassan Chafi

    IPC: G06F8/71

    Abstract: Herein are machine learning (ML) feature processing and analytic techniques to detect anomalies in parse trees of logic statements, database queries, logic scripts, compilation units of general-purpose programing language, extensible markup language (XML), JAVASCRIPT object notation (JSON), and document object models (DOM). In an embodiment, a computer identifies an operational trace that contains multiple parse trees. Values of explicit features are generated from a single respective parse tree of the multiple parse trees of the operational trace. Values of implicit features are generated from more than one respective parse tree of the multiple parse trees of the operational trace. The explicit and implicit features are stored into a same feature vector. With the feature vector as input, an ML model detects whether or not the operational trace is anomalous, based on the explicit features of each parse tree of the operational trace and the implicit features of multiple parse trees of the operational trace.

    Dynamic resolution of dependencies for database guest languages
    50.
    发明授权
    Dynamic resolution of dependencies for database guest languages 有权

    公开(公告)号：US11294894B2

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

    申请号：US16556760

    申请日：2019-08-30

    Applicant: Oracle International Corporation

    Inventor： Pit Fender ,  Harshad Kasture ,  Alexander Ulrich ,  Benjamin Schlegel ,  Matthias Brantner ,  Hassan Chafi

    IPC: G06F16/24 ,  G06F16/242 ,  G06F16/25 ,  G06F8/30

    Abstract: Herein are techniques that extend a software system to embed new guest programing languages (GPLs) that interoperate in a transparent, modular, and configurable way. In embodiments, a computer inserts an implementation of a GPL into a deployment of the system. A command registers the GPL, define subroutines for the GPL, generates a guest virtual environment, and adds a binding of a dependency to a guest module. In an embodiment, a native programing language invokes a guest programing language to cause importing intra- or inter-language dependencies. An embodiment defines a guest object that is implemented in a first GPL and accessed from a second GPL. In an embodiment, dependencies are retrieved from a virtual file system having several alternative implementation mechanisms that include: an archive file or an actual file system, and a memory buffer or a column of a database table.

Patent Agency Ranking