Huawei Technologies Co., Limited

Antoni Wolski

Eliezer Levy

Shay Goikhman

Mahesh Kumar Behera

Prasanna Venkatesh Ramamurthi

Antonios Iliopoulos

Zhibiao Chen

Aharon Avitzur

Kalyan Sivakumar

Usama Dar

Shay Goikman

Provided is a process for determining a number of parallel threads for a request. The process involves receiving availability data regarding processing resources, wherein the availability data indicates which processing resources are idle or are to become idle. Based on the availability data, a number of parallel threads for the request is determined.

System and method for dynamic determination of a number of parallel threads for a request

A device for executing an operation on a database is provided. The device comprises a C-queue configured to store a plurality of column-oriented operations, an R-queue configured to store a plurality of row-oriented operations, a scheduler configured to assign the operation to the C-queue or the R-queue based on whether the operation is row-oriented, a timing unit configured to alternate between C-type time slots and R-type time slots, an execution unit configured to execute operations from the C-queue in C-type time slots and/or operations from the R-queue in R-type time slots.

Data locking method based on alternating row and column locks

A method for copying values of a table of a database between a primary memory and a secondary memory comprises selecting one or more segments, wherein the table is organized in a plurality of stripes and a plurality of vertical partitions, wherein a stripe comprises at least two rows of the table, wherein a vertical partition comprises one or more columns of the table, wherein each of the plurality of segments comprises values at a cross-section of a stripe and a vertical partition, and wherein each of the plurality of segments stores adjacent column values in adjacent locations of the primary or the secondary memory, and copying the one or more selected segments between the primary memory and the secondary memory.

Method, apparatus and data structure for copying values of a table of a database

A method for tracking objects in a first memory during a plurality of time intervals is provided, wherein the method comprises: updating, by one or more update threads, copying, by the one or more test threads, the one or more non-copied shadow objects to a second memory, determining, by the one or more test threads whether the step of copying the one or more non-copied shadow objects was successful, and updating, by the one or more test threads, the status variables of corresponding objects that correspond to the one or more non-copied shadow objects that were copied successfully, wherein subsequent bits of the status variables correspond to subsequent time intervals and wherein the one or more update threads and the one or more test threads operate on disjoint sets of bits of the status variables.

Method and apparatus for tracking objects in a first memory

Growing community of inventors

Munich, Germany

Antoni Wolski