公开(公告)号：US20220405288A1

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

申请号：US17468427

申请日：2021-09-07

Applicant: SAP SE

Inventor： Robert Lasch ,  Thomas Legler ,  Robert Schulze ,  Kai-Uwe Sattler

IPC: G06F16/245 ,  G06F16/2455 ,  G06F11/34

Abstract: A method, a system, and a computer program product for placement or storage of data structures in memory/storage locations. A type of a data structure for storing data and a type of data access to the data structure are determined. The type of data access includes a first and a second type of data access. A frequency of each type of access to each type of data structure accessed by a query is determined. Using the determined frequency, a number of first type of data accesses to the data structure is compared to a number of second type of accesses to the data structure. The numbers of first and second types of data access are compared to a predetermined threshold percentage of a total number of data accesses to the data structure. Based on the comparisons, a physical memory location for storing data is determined.

公开(公告)号：US10762068B2

公开(公告)日：2020-09-01

申请号：US15945723

申请日：2018-04-04

Applicant: SAP SE

Inventor： Thomas Legler ,  Andreas Tonder

IPC: G06F16/00 ,  G06F16/22 ,  G06F16/25 ,  G06F16/2453

Abstract: A system for implementing virtual columns in a column store database is provided. In some implementations, the system performs operations including accessing a database table in a column store database system, the database table comprising at least one virtual column, the column store database system storing data in a column-oriented structure. The operations further include calculating a value for the at least one virtual column based on at least one existing column of the database table, the calculated value mapped to a row identifier associated with a row of the database table. The operations further include providing, in response to a query, the calculated value to a user interface, the query associated with the row identifier.

公开(公告)号：US10445076B1

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

申请号：US15973058

申请日：2018-05-07

Applicant: SAP SE

Inventor： Thomas Legler

IPC: G06F12/08 ,  G06F8/41 ,  G06F12/0862 ,  G06F16/22 ,  G06F16/2455 ,  G06F12/0844

Abstract: A system for cache efficient reading of column values in a database is provided. In some aspects, the system performs operations including pre-fetching, asynchronously and in response to a request for data in a column store database system, a plurality of first values associated with the requested data. The request may identify a row of the column store database system associated with the requested data. The plurality of first values may be located in the row. The operations may further include storing the plurality of first values in a cache memory. The operations may further include pre-fetching, asynchronously and based on the plurality of first values, a plurality of second values. The operations may further include storing the plurality of second values in the cache memory. The operations may further include reading, in response to the storing the plurality of second values, the requested data from the cache memory.

公开(公告)号：US20190278608A1

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

申请号：US15915787

申请日：2018-03-08

Applicant: SAP SE

Inventor： Georgios Psaropoulos ,  Thomas Legler ,  Norman May ,  Anastasia Ailamaki

IPC: G06F9/38 ,  G06F9/30 ,  G06F17/30

Abstract: A method for optimizing memory access for database operations is provided. The method may include performing a database operation by at least executing a first instruction stream associated with the first database operation. The first database operation may be defined as a coroutine to at least enable the execution of the first instruction stream to be interleaved with an execution of a second instruction stream. In response to determining that data required to continue the execution of the first instruction stream is absent from a cache, the execution of the first instruction may be suspended and the second instruction stream may be executed instead. Related systems and articles of manufacture, including computer program products, are also provided.

公开(公告)号：US10235420B2

公开(公告)日：2019-03-19

申请号：US15634243

申请日：2017-06-27

Applicant: SAP SE

Inventor： Peter Steinemann ,  Thomas Legler

IPC: G06F17/30

Abstract: The present disclosure involves systems, software, and computer implemented methods for providing a bucket skiplist. In one example, a method comprises identifying a value to be searched for within a skiplist comprising a data structure for referencing a plurality of ordered nodes, the data structure having a plurality of linked lists, each node representing at least one memory block, wherein each node is associated with a bucket including a set of ordered values, where the first value in each bucket of each node is the relatively lowest value in the bucket, comparing the value to the first values in each bucket to identify a particular node in which the first value may be located, and, in response to determining that the first value of the particular node is not the same as the value to be searched, comparing the value to be searched with the ordered values in the bucket.

公开(公告)号：US20180210922A1

公开(公告)日：2018-07-26

申请号：US15416680

申请日：2017-01-26

Applicant: SAP SE

Inventor： Robert Schulze ,  Oliver Horn ,  Thomas Legler

IPC: G06F17/30

Abstract: A system for generating a query plan is provided. In some example embodiments, the system performs operations comprising: determining, at a query execution engine, a first primitive call for implementing a query operation on data at a database; performing the query operation by at least sending, to a data management engine coupled to the database, the first primitive call for execution by the data management engine; and determining, based at least on a result of the first primitive call, a result of the query operation. Related methods and articles of manufacture, including computer program products, are also described.

公开(公告)号：US10013442B2

公开(公告)日：2018-07-03

申请号：US14748036

申请日：2015-06-23

Applicant: SAP SE

Inventor： Thomas Legler ,  Peter Steinemann

IPC: G06F17/30

CPC classification number: G06F16/2255

Abstract: The subject matter disclosed herein provides methods for inserting and retrieving value identifiers from a dictionary encoded database using hash maps. A first value identifier and a first value can be accessed from a dictionary storing one or more value identifiers and one or more values. Each value identifier can correspond to a different value. The hash map and the first value can be used to determine a first index in a bucket list for inserting the first value identifier. The bucket list can have one or more indices. Each index can store at least one value identifier. The hash map can include a vector of one or more pointers. Each pointer can refer to at least one of the indices. Based on the determining, the first value identifier can be inserted at the first index without inserting the first value. Related apparatus, systems, techniques, and articles are also described.

公开(公告)号：US20170293661A1

公开(公告)日：2017-10-12

申请号：US15634243

申请日：2017-06-27

Applicant: SAP SE

Inventor： Peter Steinemann ,  Thomas Legler

IPC: G06F17/30

CPC classification number: G06F17/30528 ,  G06F17/30321 ,  G06F17/30501

Abstract: The present disclosure involves systems, software, and computer implemented methods for providing a bucket skiplist. In one example, a method comprises identifying a value to be searched for within a skiplist comprising a data structure for referencing a plurality of ordered nodes, the data structure having a plurality of linked lists, each node representing at least one memory block, wherein each node is associated with a bucket including a set of ordered values, where the first value in each bucket of each node is the relatively lowest value in the bucket, comparing the value to the first values in each bucket to identify a particular node in which the first value may be located, and, in response to determining that the first value of the particular node is not the same as the value to be searched, comparing the value to be searched with the ordered values in the bucket.