Sap Se

Robert Lasch

Norman May

Ismail Oukid

Thomas Legler

Kai-Uwe Sattler

Robert Schulze

Bernhard Scheirle

A method, a system, and a computer program product for decompressing data. One or more compressed blocks in a set of stored compressed blocks responsive to a request to access data in the set of stored compressed blocks are identified. String prefixes inside the identified compressed blocks are decompressed using front coding. String suffixes inside the identified compressed blocks are decompressed using a re-pair decompression. Uncompressed data is generated.

Advanced database decompression

Embodiments of the present disclosure include techniques for cooperative memory management. In one embodiment, a database management system includes a memory manager for managing a memory buffer. The memory buffer is configured to allocate memory to table data and temporary data dynamically. In some embodiments, table data memory allocations are reduced and temporary data memory allocations are increased to process queries. Temporary data memory allocations may be increased to store temporary data associated with one or more portions of a query. The memory buffer reallocates table data memory allocations and temporary data memory allocations as needed to more efficiently use available memory.

Cooperative memory management in database management systems

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.

Storage of data structures

A method, a system, and a computer program product for executing a database compression. A compressed string dictionary having a block size and a front coding bucket size is generated from a dataset. Front coding is applied to one or more buckets of strings in the dictionary having the front coding bucket size to generate one or more front coded buckets of strings. One or more portions of the generated front coded buckets of strings are concatenated to form one or more blocks having the block size. Each block is compressed. A set of compressed blocks is stored. The set of the compressed blocks stores all strings in the dataset.

Growing community of inventors

Walldorf, Germany

Robert Lasch