中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

58 records (took 0.017 seconds)

    VECTORIZED HASH TABLES
    13.
    发明申请
    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
    14.
    发明申请
    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.

    RELATIONAL DICTIONARIES
    17.
    发明申请
    RELATIONAL DICTIONARIES 审中-公开

    公开(公告)号：US20190155930A1

    公开(公告)日：2019-05-23

    申请号：US15819193

    申请日：2017-11-21

    Applicant: Oracle International Corporation

    Inventor： Pit Fender ,  Seema Sundara ,  Benjamin Schlegel ,  Nipun Agarwal

    IPC: G06F17/30

    Abstract: Techniques related to relational dictionaries are disclosed. In some embodiments, one or more non-transitory storage media store a sequence of instructions which, when executed by one or more computing devices, cause performance of a method. The method involves storing a code dictionary comprising a set of tuples. The code dictionary is a database table defined by a database dictionary and comprises columns that are each defined by the database dictionary. The set of tuples maps a set of codes to a set of tokens. The set of tokens are stored in a column of unencoded database data. The method further involves generating encoded database data based on joining the unencoded database data with the set of tuples. Furthermore, the method involves generating decoding database data based on joining the encoded database data with the set of tuples.

Patent Agency Ranking