Sap Se

Sap Ag

Hyundai Mobis Co., Ltd.

Hyundai Motor Company

Yong Sik Kwon

Juchang Lee

Yongsik Yoon

Sang Kyun Cha

Hyeong Seog Kim

Ji Hoon Jang

Joo Yeon Lee

Chanho Jeong

Chang Bin Song

Seyeong Bae

Oliver M Steinau

Markus Hartmann

Beomsoo Kim

Patrick Voelker

Mihnea Andrei

Jaeyoung Choi

Jaeyun Noh

Hyunjun Kim

Eunsang Kim

Jong Sung Kim

Norman May

Kyu Hwan Kim

Thorsten Glebe

Meinolf Block

Martin Schindewolf

Jian Luo

Martin Kittel

Uwe Hahn

Holger Mack

Seungho Yoo

Urs Klingsporn

Christian Bensberg

Dirk Thomsen

Jonathan Bregler

Alexander Boehm

Michael Muehle

Martin Heidel

Lars Dannecker

Werner Thesing

Chul Won Lee

Ivan T Bowman

Dong Yoon Hyun

Jong Yun Jeong

Sascha Zorn

Frank Renkes

Joung Hee Lee

Myung Sun Park

Henning Zahn

Andre Schefe

Ruediger Karl

Christoph Hohner

Johannes Beigel

Marcel Birn

Fabian Garagnon

Won Wook Hong

Kunsoo Park

Changseob Lee

Youngho Yoo

Cheol Yoo

Melanie Handreck

Sergej Hardock

Andreas Hartel

Systems and methods include reception of a request to move a first database tenant from a first database instance to a second database instance, the first database tenant comprising a first tenant object instance associated with a plurality of artifacts of the first database instance, the plurality of artifacts including a tenant-level catalog and data. In response to the request, the tenant-level catalog is exported from the first database instance to a shared storage system, the tenant-level catalog is imported to a second tenant of the second database instance from the shared storage system, the data is exported from the first database instance to the shared storage system, the data is imported to the second tenant of the second database instance from the shared storage system, and the first database tenant is dropped from the first database instance.

Database tenant-level move

Systems and methods include determination of a first encryption key associated with a data page of a row store database table stored in a volatile memory, based on a header of the data page, encryption of a body of the data page using the first encryption key, and storage of an encrypted data page comprising the header and the encrypted body in a persistent storage system.

Native multi-tenant row table encryption

Systems and methods include creation of a first instance of a tenant object in a database instance, association of the first instance of the tenant object with a first plurality of database artifacts including first data associated with the first instance of the tenant object, creation of a second instance of the tenant object in the database instance, association of the second instance of the tenant object with a second plurality of database artifacts including second data associated with the second instance of the tenant object, and reception and response to queries on the first data associated with the first instance of the tenant object and to queries on the second data associated with the second instance of the tenant object.

Native multi-tenancy for database system

Systems and methods include reception of an instruction to recover a first database tenant of a first database instance to a first point in time, the first database tenant associated with first database artifacts of the first database instance, and the first database instance including two or more database tenants and, in response to the instruction, creation of a second database instance, selection of backup data of the first database instance based on the first point in time, execution of a recovery of the backup data on the second database instance, export of second database artifacts of the first database tenant from the second database instance to a storage, truncation of the first database artifacts from the first database instance, import of the second database artifacts from the storage to the first database instance, and deletion of the second database instance.

Tenant-level database recovery

A database system includes a persistent storage system, a memory storing metadata defining a tenant object and a plurality of database artifacts, a first instance of the tenant object, the first instance associated with a first plurality of the database artifacts including first data associated with the first instance of the tenant object, and a second instance of the tenant object, the second instance associated with a second plurality of the database artifacts including second data associated with the second instance of the tenant object. A processing unit is to execute program code of a database instance to cause the database system to encrypt the first data associated with the first instance of the tenant object using a first public encryption key and store the encrypted first data in the persistent storage system, and encrypt the second data associated with the second instance of the tenant object using a second public encryption key and store the encrypted second data in the persistent storage system.

Native multi-tenant encryption for database system

An in-memory database server hosting a tenant of a multi-tenant software architecture can receive a definition of a custom data field that is unique to an organization having isolated access to the tenant. The custom data field can extend a standard table defined by central metadata stored at a system tenant of the multi-tenant software architecture. Tenant private metadata that includes the definition can be stored in memory accessible only to the tenant. A tenant-dependent table that includes the custom data field can be formed, for example by retrieving central metadata defining the standard table from the system tenant and adding the custom data field using the definition. The tenant-dependent table can be presented for access via a database client at the organization. Related systems, articles of manufacture, and computer-implemented methods are disclosed.

In-memory database for multi-tenancy

Methods, systems, and computer-readable storage media for receiving a first storage request indicating a first type of data and a first size, identifying a first sub-space based on the first type, the first sub-space including a dense group of dense segments and a sparse group of sparse segments, and determining that the dense group of the first sub-space is absent a dense segment to store data of the first storage request based on the first size, and in response: determining whether the sparse group of the first sub-space includes a sparse segment to store the data of the first storage request based on the first size, and storing the data of the first storage request to the sparse group of the first sub-space in response to determining that the sparse group of the first sub-space includes a sparse segment to store the data of the first storage request.

Memory allocation and deallocation mechanism to reduce fragmentation and enhance defragmentation performance

Methods, systems, and computer-readable storage media for determining that a first transaction results in a first version of data stored in a page in a database system, the first version being stored in a version space and the data being stored in a table space, in response to the first version, providing a version table for the page, the version table including a set of cells each cell corresponding to a record in the page, setting a version table pointer of the page to point to the version table, and setting a version pointer of a first cell to point to the first version in the version space, the first cell corresponding to a record of the data in the page.

Version table scheme for fast version space access

Methods, systems, and computer-readable storage media for online defragmentation of memory in database systems by applying an IX-lock to each table having data stored in a marked page in a set of marked pages, generating a record map including key-value pairs, each being associated with a record location in a marked page, a value of each key-value pair initially set to a first value, iteratively executing the online defragmentation to delete data from marked pages and add the data to non-sparse pages, at least one iteration including applying a try-lock to a record in a marked page, and at iterations of the online defragmentation, updating the record map to change the value of at least one key-value pair from the first value to the second value, the second value representing that data of a marked page has been deleted from the marked page and added to a non-sparse page.

Efficient and non-disruptive online defragmentation with record locking

Technologies are described for restarting an application while maintaining data in memory (e.g., using shared memory). For example, shared memory can be associated with an application. The shared memory can also be associated with a holder process to maintain the shared memory from the time the application stops to the time the application starts again. When the application starts, the shared memory can be associated with the started application. In addition, restart of in-memory databases can be provided using shared memory. For example, in-memory data can be maintained when a database process or database management system stops and starts (e.g., during a restart).

Fast restart of applications using shared memory

A system includes initiation of recovery from a crash of a database instance and, during the recovery, identification of a subset of pages of a memory image of the database instance which are not reusable and replacement of the identified subset of pages with corresponding pages of the savepoint image.

Database recovery using shared memory

Restoring a database image of a secondary database system comprises initializing the database image from a recovery image that includes metadata logs and non-metadata logs, of which at least one metadata log includes an undo log of non-committed data that is applied to the initialized database image. A first pagelist and first indexes are then rebuilt based on first data segments of the database image and the corresponding metadata objects. The database image is then updated by replaying the metadata redo log generated from the undo log, the metadata logs, and the non-metadata logs. Then, a second pagelist and second indexes for the database system are rebuilt based on second data segments of the database image and the corresponding non-metadata objects, while each of the first data segments is statically separated from the second data segments in physical memory space. Related apparatus, systems, techniques and articles are also described.

Physio-logical logging for in-memory row-oriented database system

A system and method, including determining, by a processor, distinction bit positions for index keys of a database index; determining, by the processor, concatenation of the bits of the index keys; and generating a record of the concatenation. Other systems and methods include collecting, by a processor, index keys of a database index in parallel, wherein data pages of a target table are evenly distributed to a plurality of processor cores; scanning, by each of the cores the data pages to extract compressed keys and corresponding record identifiers; sorting, by a plurality of the processor cores, pairs of the compressed key and corresponding record identifier in accordance with a parallel sorting algorithm; generating an index tree in a bottom-up fashion; and storing a record of the generated index tree.

Optimal sort key compression and index rebuilding

Growing community of inventors

Seoul, South Korea

Yong Sik Kwon