中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

58 records (took 0.027 seconds)

    Database modularization of pluggable guest languages
    1.
    发明授权
    Database modularization of pluggable guest languages 有权

    公开(公告)号：US11531652B2

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

    申请号：US16556847

    申请日：2019-08-30

    Applicant: Oracle International Corporation

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

    IPC: G06F16/21

    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.

    FIRST FUTAMURA PROJECTION IN THE CONTEXT OF SQL EXPRESSION EVALUATION
    2.
    发明申请
    FIRST FUTAMURA PROJECTION IN THE CONTEXT OF SQL EXPRESSION EVALUATION 有权

    公开(公告)号：US20220391392A1

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

    申请号：US17889712

    申请日：2022-08-17

    Applicant: Oracle International Corporation

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

    IPC: 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.

    First futamura projection in the context of SQL expression evaluation
    4.
    发明授权
    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.

    TWO-VALUED LOGIC PRIMITIVES FOR SQL QUERY PROCESSING
    6.
    发明申请
    TWO-VALUED LOGIC PRIMITIVES FOR SQL QUERY PROCESSING 有权

    公开(公告)号：US20210294795A1

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

    申请号：US16823632

    申请日：2020-03-19

    Applicant: Oracle International Corporation

    Inventor： Pit Fender ,  Benjamin Schlegel ,  Alexander Ulrich

    IPC: G06F16/245

    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.

    CODE DICTIONARY GENERATION BASED ON NON-BLOCKING OPERATIONS
    8.
    发明申请
    CODE DICTIONARY GENERATION BASED ON NON-BLOCKING OPERATIONS 审中-公开

    公开(公告)号：US20190251194A1

    公开(公告)日：2019-08-15

    申请号：US15897375

    申请日：2018-02-15

    Applicant: Oracle International Corporation

    Inventor： Pit Fender ,  Felix Schmidt ,  Benjamin Schlegel ,  Matthias Brantner ,  Nipun Agarwal

    IPC: G06F17/30

    CPC classification number: G06F16/2365 ,  G06F16/221 ,  G06F16/285

    Abstract: Techniques related to code dictionary generation based on non-blocking operations are disclosed. In some embodiments, a column of tokens includes a first token and a second token that are stored in separate rows. The column of tokens is correlated with a set of row identifiers including a first row identifier and a second row identifier that is different from the first row identifier. Correlating the column of tokens with the set of row identifiers involves: storing a correlation between the first token and the first row identifier, storing a correlation between the second token and the second row identifier if the first token and the second token have different values, and storing a correlation between the second token and the first row identifier if the first token and the second token have identical values. After correlating the column of tokens with the set of row identifiers, duplicate correlations are removed.

Patent Agency Ranking