中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

45 records (took 0.022 seconds)

    VECTORIZED HASH TABLES
    2.
    发明申请
    VECTORIZED HASH TABLES 有权

    公开(公告)号：US20210271710A1

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

    申请号：US16803819

    申请日：2020-02-27

    Applicant: Oracle International Corporation

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

    IPC: G06F16/901 ,  G06F9/38

    Abstract: Techniques are described herein for a vectorized hash table that uses very efficient grow and insert techniques. A single-probe hash table is grown via vectorized instructions that split each bucket, of the hash table, into a respective upper and lower bucket of the expanded hash table. Further, vacant slots are indicated using a vacant-slot-indicator value, e.g., ‘0’, and all vacant slots follow to the right of all occupied slots in a bucket. A vectorized compare instruction determines whether a value is already in the bucket. If not, the vectorized compare instruction is also used to determine whether the bucket has a vacant slot based on whether the bucket contains the vacant-slot-indicator value. To insert the value into the bucket, vectorized instructions are used to shift the values in the bucket to the right by one slot and to insert the new value into the left-most slot.

    INFERRING INTRA PACKAGE AND MODULE DEPENDENCIES
    3.
    发明申请
    INFERRING INTRA PACKAGE AND MODULE DEPENDENCIES 有权

    公开(公告)号：US20210173621A1

    公开(公告)日：2021-06-10

    申请号：US16703499

    申请日：2019-12-04

    Applicant: Oracle International Corporation

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

    IPC: G06F8/41 ,  G06F16/21 ,  G06F16/23 ,  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.

    Database modularization of pluggable guest languages
    6.
    发明授权
    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
    7.
    发明申请
    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
    9.
    发明授权
    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.

Patent Agency Ranking