Sap Se

Sybase, Inc.

Other

Sap Global IP Group

Mihnea Andrei

Ivan Schreter

Colin Florendo

Reza Sherkat

Anil Kumar Goel

Juchang Lee

Rolando Blanco

David Wein

Stefan A Baeuerle

Anisoara Nica

Ruediger Karl

Joo Yeon Lee

Robert Schulze

Alexander Boehm

Amarnadh Sai Eluri

Sebastian Seifert

Chaitanya Gottipati

Muhammed Sharique

Seyeong Bae

Adrian Dragusanu

Christian Bensberg

Thomas Legler

Thorsten Glebe

Martin Heidel

Eunsang Kim

Christian Lemke

Patrick Voelker

Norman May

Dirk Thomsen

Steffen Geissinger

Guenter Radestock

Yong Sik Kwon

Amit Pathak

Michael Muehle

Xun Cheng

Carsten Thiel

Vivek Kandiyanallur

Panfeng Zhou

Nirvik Basak

Anupam Mukherjee

Vimal Chandran Satheesh

Kyu Hwan Kim

Jaeyoung Choi

Thomas Peh

Meinolf Block

John Smirnios

Hyunjun Kim

Shiping Chen

Martin Schindewolf

Neeraj Kulkarni

Peter Steinemann

Hyejeong Lee

Changgyoo Park

Deepak Shrivastava

Souvik Pal

Surendra Vishnoi

David Edward DeHaan

Martin Kittel

Friedrich Keller

Uwe Hahn

Holger Mack

Xin Liu

Urs Klingsporn

Chang Gyoo Park

Jonathan Bregler

Peter Bumbulis

Lars Dannecker

Werner Thesing

Ivan T Bowman

Sascha Zorn

Frank Renkes

Beomsoo Kim

Myung Sun Park

Torsten Ziegler

Henning Zahn

Andre Schefe

Joern Schmidt

Frank-Martin Haas

Janardhan Hungund

Yanhong Wang

Sudipto Rai Chowdhuri

Simhachala Sasikanth Gottapu

Sarika Iyer

Edwin Anthony Seputis

Bernhard Scheirle

Christoph Hohner

Jian Luo

Johannes Alberti

Prasanta Ghosh

Johannes Beigel

Xiao Ming Zhou

Prabhas Kumar Samanta

Fabian Garagnon

Frank Benkstein

Christian Hansen

Mark Delafranier

Amit Saonerker

Xun Chen

Calvin Hua

Mahesh Gadgil

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

A database system detects an operation to move a first database object from an in-memory store to a persistence store, wherein the first database object is in either a page-loadable or column-loadable format in the in-memory store, and wherein the first database object comprises a plurality of subcomponents. Each subcomponent of the first database object is examined separately from other subcomponents of the plurality of subcomponents. In response to determining that a first subcomponent of the plurality of subcomponents has a datatype and a compression type supported by a unified persistence format, the first subcomponent is stored in a unified persistence format in the persistence store. In response to determining that a second subcomponent of the plurality of subcomponents has either a datatype or a compression type which is not supported by the unified persistence format, the second subcomponent is stored in a serial persistence format in the persistence store.

Unified persistence overall feature

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

Techniques and solutions are described for implementing virtual table schemas. A virtual table schema includes a logical pointer that is used to target a table that includes data and is defined according to the virtual table schema. Values assigned to the logical pointer can be used to target tables at different locations, such as in a federated database system or in a cache of a database management system of a central computing system. When data associated with the virtual table is requested, or prior to receiving the request, the data can be stored in a table in the cache. The logical pointer can be updated to reference the cache. If the cache is full, the table can be removed from the cache, and the logical pointer can be updated to reference a table at the federated database system.

Virtual database tables with updatable logical table pointers

Techniques and solutions are described for implementing virtual table schemas. A virtual table schema includes a logical pointer that is used to target a table that includes data and is defined according to the virtual table schema. Values assigned to the logical pointer can be used to target tables at different locations, such as in-memory storage or in dynamic storage of a database management system. The dynamic storage includes an in-memory buffer cache and persistent storage. The logical pointer can be updated to point to the in-memory storage or the dynamic storage, including based on use statistics. Similarly, a table having data for the virtual table can be transitioned between the in-memory buffer cache and the persistent storage, including based on use statistics for the virtual table. A value for the logical pointer can be updated when the table is transferred between the in-memory buffer cache and the dynamic storage.

Disclosed herein are system, method, and computer-program product embodiments for generating a paged and in-memory representation of a database object. An embodiment operates by maintaining in-memory and paged form primitives unique to the database object or a substructure thereof in a database such that the in-memory and paged form primitives are capable of providing the in-memory and paged representations of the database objects, respectively. Thereafter, a load configuration for the database object is determined. Based on the load configuration, the in-memory and/or paged representations of the database object are generated using the in-memory form primitive or the paged form primitive unique to the database object, respectively. Subsequently, the in-memory and/or paged representations of the database object are stored in the database.

Hybrid column store providing both paged and memory-resident configurations

Disclosed herein are system, method, and computer program product embodiments for using a data statistic as a dynamic data integrity constraint. An embodiment operates by defining a data statistic for a column or a set of columns of a partition of a plurality of partitions of a database table. The embodiment creates a constraint data statistics object based on the data statistic. The embodiment receives a query for the database table. The embodiment determines the constraint data statistics object is consistent with a data state of the partition. The embodiment derives an implied constraint based on the constraint data statistics object. The embodiment processes the query for the partition based on the implied constraint.

Constraint data statistics

Disclosed herein are system, method, and computer program product embodiments for performing dynamic partition pruning using data statistic objects as data integrity constraints. An embodiment operates by partitioning a database table into a plurality of partitions based on a partition criterion. The embodiment creates a data statistics object for a partition in the plurality of partitions. The embodiment receives a query for the database table. The embodiment determines the data statistics object is consistent with data in the partition. The embodiment processes the query for the partition based on the data statistics object.

Constraint data statistics for dynamic partition pruning

A computer-implemented method for database management is provided. The method comprises: receiving, from a client device , first data to be stored in a database system that comprises first data storage configured to store a data table and a deletion history table; storing the first data in second data storage that is external to the database system and that is in communication with the database system via a network; obtaining a link that enables access, via the network, to the first data stored in the second data storage; storing the link in the data table; and performing a deletion operation of the first data, in response to a request from the client device to delete the first data from the database system, wherein the deletion operation comprises: deleting the link from the data table without deleting the first data from the second data storage; and storing the link in the deletion history table with a timestamp corresponding to a point in time when the link is deleted from the data table.

Computer-implemented method for database management, computer program product and database system

Provided is a database system and method in which storage is partitioned in an unbalanced format for faster access. In one example, the method may include one or more of receiving a request to store a data record, identifying a partition from among a plurality of partitions of a database based on a shard identifier in the request, automatically determining a unique range of data identifiers designated to the partition from the plurality of partitions, respectively, based on an unbalanced partitioning, determining whether the data identifier is available within the unique range of data identifiers of the identified partition, and storing the data record at the identified partition in response to determining the data identifier is available. The unbalanced partitioning according to various embodiments reduces the partitions that need to be checked during a data insert/access operation of the database.

Unbalanced partitioning of database for application data

A request for an entry of a dictionary having multiple dictionary blocks may be received, where the dictionary stores string values associated with corresponding value identifiers (IDs) for dictionary compression. One of the dictionary blocks may be selectively loaded into memory, and the dictionary block that has been loaded into memory may be searched. A value ID directory may be constructed in memory, where the value ID directory includes last value IDs for the dictionary blocks, and each of the last value IDs is mapped to an index of one of the dictionary blocks that includes a string value for that last value ID. A separator directory may also be constructed in memory, where the separator directory includes separators for the dictionary blocks, and each of the separators is mapped to an index of one of the dictionary blocks that includes a string value for that separator.

Paged column dictionary

A system and method, including determining, by a processor, a data type for each column of a database table; determining, by the processor and based on the determined data type for each column of the database table, an indication of a size of the database table; calculating, by the processor and based on the determined indication of the size of the database table, a start nbit size for a nbit compression process to be used on the database table; specifying, by the processor, the calculated start nbit size for the nbit compression process; and compressing the database table by executing the nbit data compression process using the specified start nbit size.

Smart rollover

Growing community of inventors

Issy les Moulineaux, France

Mihnea Andrei