公开(公告)号：US11126611B2

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

申请号：US15897375

申请日：2018-02-15

Applicant: Oracle International Corporation

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

IPC: G06F16/23 ,  G06F16/22 ,  G06F16/28

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.

公开(公告)号：US20210232402A1

公开(公告)日：2021-07-29

申请号：US17227167

申请日：2021-04-09

Applicant: ORACLE INTERNATIONAL CORPORATION

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

IPC: G06F9/38 ,  G06F15/80

Abstract: Techniques are provided for vectorizing Heapsort. A K-heap is used as the underlying data structure for indexing values being sorted. The K-heap is vectorized by storing values in a contiguous memory array containing a beginning-most side and end-most side. The vectorized Heapsort utilizes horizontal aggregation SIMD instructions for comparisons, shuffling, and moving data. Thus, the number of comparisons required in order to find the maximum or minimum key value within a single node of the K-heap is reduced resulting in faster retrieval operations.

公开(公告)号：US20210224257A1

公开(公告)日：2021-07-22

申请号：US16744635

申请日：2020-01-16

Applicant: Oracle International Corporation

Inventor： Pit Fender ,  Benjamin Schlegel ,  Matthias Brantner

IPC: G06F16/242 ,  G06F16/22 ,  G06F16/2458

Abstract: Techniques described herein proposes a Dependent Grouping Column Rewrite that simplifies a grouping operation by excluding dependent grouping columns from a group by clause. A non-blocking aggregation function is applied to dependent grouping columns in at least select clauses. Such a simplified grouping operation reduces memory pressure, speeds up grouping operations, and saves compute time, as grouping columns that have no additional effect on the grouping operation are excluded from processing (e.g., hashing and key matching).

公开(公告)号：US20210019315A1

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

申请号：US16516898

申请日：2019-07-19

Applicant: Oracle International Corporation

Inventor： Pit Fender ,  Benjamin Schlegel ,  Matthias Brantner

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

公开(公告)号：US10417036B2

公开(公告)日：2019-09-17

申请号：US15864863

申请日：2018-01-08

Applicant: Oracle International Corporation

Inventor： Daniele Bonetta ,  Matthias Brantner

IPC: G06F9/455 ,  G06F8/30 ,  G06F16/20 ,  G06F16/80

Abstract: Computer-implemented techniques described herein provide fast access to structured, semi-structured, and unstructured data using a virtual machine that provides support for dynamic code generation. In an embodiment, a virtual machine allows for the efficient encoding of data objects into hierarchically marked up data. A virtual machine is configured to dynamically create attributes of objects referenced by a body of code and hidden classes used to store attributes of objects referenced by the body of code. The virtual machine will determine whether a hidden class of an object satisfies one or more encoding criteria for encoding instances of objects with the hidden class. Encoding machine code is generated and executed to encode instances of objects with the hidden class. In another embodiment, direct structure decoding enables the generation of efficient machine code that is specialized for accessing only a subset of the input data that is used by an application. A parse operation is received to parse a hierarchical data object and a proxy object is created in a runtime memory space that references the hierarchical data object. It is then determined that the hierarchical data object is syntactically valid, and in response to receiving a request to read a property of the hierarchical data object, a subset of hierarchical data from the hierarchical data object is parsed to materialize a value of the property in the proxy object.