Sap Se

Sap Ag

Other

Sap Global IP Group

Ivan Schreter

Mihnea Andrei

Dirk Thomsen

Juchang Lee

Colin Florendo

Daniel Booss

Franz Faerber

David Wein

Blaine French

Anil Kumar Goel

Steffen Geissinger

Thomas Legler

Thorsten Glebe

Amarnadh Sai Eluri

Mehul Wagle

Reza Sherkat

Rolando Blanco

Axel Schroeder

Eunsang Kim

Panfeng Zhou

Changgyoo Park

Sergey Yurenev

Ismail Oukid

Guenter Radestock

Michael Muehle

Martin Heidel

Chaitanya Gottipati

Carsten Thiel

Shiping Chen

Robert Kettler

Thomas Willhalm

Chang Gyoo Park

Sang Kyun Cha

Robert Schulze

Alexander Boehm

Peter Bumbulis

Werner Thesing

Tobias Scheuer

Jaeyun Noh

Frank Renkes

Andreas Tonder

Sebastian Seifert

Muhammed Sharique

Christian Lemke

Hendrik C R Lock

Joern Schmidt

Deepak Shrivastava

Oliver Rebholz

Hans-Martin Ludwig

Martin Richtarsky

Chang-Gyoo Park

Janusz Smilek

Abdelkader Sellami

Frank Benkstein

Harshada Khandekar

Gunter Radestock

Akanksha Meghlan

Daniel Egenolf

Adrien Lespinasse

Steffen Geiβinger

Rajendra Kumar Reddy Koduru

Christian Latzel

Toblas Stolzenberger

A method for processing a query may include receiving a query associated with one or more predicate columns and one or more aggregate columns. To respond to the query, one or more partial data pages including the one or more predicate columns but not the one or more aggregate columns may be loaded from disk to memory. For each partial data page, a first value occupying the one or more predicate columns may be evaluated to identify one or more rows satisfying a predicate associated with the query. A portion of a data page containing the aggregate columns may be loaded from disk into memory. A result of the query corresponding to a second value occupying the aggregate columns may be generated based on the portion of the data page loaded in the memory. Related systems and articles of manufacture are also provided.

Query processing for disk based hybrid transactional analytical processing system

Systems and methods include storage of database table shards on a plurality of storage nodes. Each shard may be stored as multiple replicas, where each replica of a given shard is stored on a different storage node. In case of a failure of a given storage node, all shard replicas which were stored on the given storage node are copied from other storage nodes to new or existing storage nodes. A storage node may store shards of database tables associated with multiple tenants.

Cloud database storage system

Systems and methods include reception of a request to recover data of a first tenant to a point in time, determination of backups of first and second database table shards corresponding to the point in time, and generation of metadata associating a second tenant with the first and second shards and the backups. In response to a request to access the first second shards, it is determined based on the metadata that the first and second shards are not stored in a storage layer and, in response, the first shard is recovered to a first storage node from the backup of the first shard, the second shard is recovered to a second storage node from the backup of the second shard, and identifiers of the first storage node and the second storage node are returned.

Time travel using incremental database recovery

Systems and methods include storage a backup of a first shard of a first database table of a database in a first backup location, the first shard including a first key range of the first database table, storage of a backup of a second shard of the first database table in a second backup location, the second shard including a second key range of the first database table, reception of an instruction to recover the database, and, in response to the instruction, recovery of the first shard to a first storage node from the first backup location and, in parallel, recover the second shard to a second storage node from the second backup location.

Incremental recovery for a cloud database

A method for compressing columnar data may include generating, for a data column included in a data chunk, a dictionary enumerating, in a sorted order, a first set of unique values included in the first data column. A compression technique for generated a compressed representation of the data column having a fewest quantity of bytes may be identified based at least on the dictionary. The compression technique including a dictionary compression applying the dictionary and/or another compression technique. A compressed data chunk may be generated by applying the compression technique to compress the data column included in the data chunk. The compressed data chunk may be stored at a database in a variable-size persistent page whose size is allocated based on the size of the compressed representation of the data column. Related systems and articles of manufacture are also provided.

Data compression for columnar databases into arbitrarily-sized persistent pages

A thread executing a task at a node in a multi-socket computing system may access a first data structure to obtain a first calibration dataset for the node. The first thread may generate a timestamp based on the first calibration dataset and a first quantity of time measured by a clock at the first node. The real-time duration of the task may be determined based on the timestamp. The first thread may recalibrate the first clock by at least generating, based on the first quantity of time measured by the clock and a second quantity of time measured by a wall clock of an operating system of the multi-socket computing system, a second calibration dataset. The first thread may update the first data structure to include the second calibration dataset while a second thread accesses a second data structure to obtain calibration data.

Time calibration for a multi-socket computing system

A method for caching partial data pages to support optimized transactional processing and analytical processing with minimal memory footprint may include loading, from disk to memory, a portion of a data page. The memory may include a first cache for storing partial data pages and a second cache for storing full data pages. The first portion of the data page may be loaded into the first cache. A data structure may be updated to indicate that the portion of the data page has been loaded into the first cache. When the data structure indicates that the data page has been loaded into the first cache in its entirety, transferring the data page from the first cache to the second cache. One or more queries may be performed using at least the portion of the data page loaded into the memory. Related systems and articles of manufacture are also provided.

Caching for disk based hybrid transactional analytical processing system

A system and method of query processing in a multi-level storage system having a unified table architecture. A query is received by a common query execution engine connected with the unified table architecture, the query specifying a data record. The common query execution engine performs a look-up for the data record based on the query at the first level storage structure. If the data record is not present at the first level storage structure, the common query execution engine performs separate look-ups in each of the second level storage structure and the main store.

Unified table query processing

A system and method of managing highly-volatile statistics of a multi-threaded application environment. The statistics are represented by one or more statistics objects. Each statistics object of the one or more statistics objects is prefixed with an object header having a version counter with an initial version count of zero. Each statistics object is associated with a statistics class instance, each statistics class instance being associated with an associative registry that is configured to allocate smallest possible objects of a size equal to or greater than to that of the statistics objects, the registry segmenting the statistics objects according to a size class. Each allocated statistics object is constructed in the object frame after the object header. Then, the object header of each allocated statistics object is initialized. Once allocated, objects can be deallocated.

High-performance statistics

Time calibration across multi-socket computing systems

A method may include performing, at multiple data partitions, a point-in-time recovery to a specified time by applying transactions that have committed at each data partition up to the specified time. Open transactions that have not been committed at each data partition at the specified time may be identified. A corresponding transaction coordinator may be queried for an outcome of the open transactions. Open transactions that affect a single data partition may be aborted. The point-in-time recovery may be performed at the transaction coordinator partitions by determining the outcome of the open transactions. The transaction coordinator partitions may abort any transaction that remains open subsequent to the point-in-time recovery. If the specified time may be greater than a safety threshold, data up to an earlier point-in-time than specified may be recovered depending on whether there are missing portions of transaction logs at the data partitions or the transaction coordinator partitions.

Backup and recovery for distributed database with scalable transaction manager

A method may include responding to a transaction by sending, to a first data partition participating in the transaction, a first request to set a first transaction control block at the first data partition to a preparing state. In response to the transaction affecting multiple data partitions, a second request to set a second transaction control block at a second data partition to the preparing state may be sent to the second data partition. A third request to add the first data partition and the second data partition as participants of the transaction may be sent to the transaction coordinator. The transaction coordinator may determine, based on a first response of the first data partition and a second response of the second data partition, an outcome of the transaction. The transaction may be rolled back if the first response and/or the second response indicate an inability to commit the transaction.

Scalable transaction manager for distributed databases

Growing community of inventors

Malsch, Germany

Ivan Schreter