Sap Se

Johannes Beigel

Christian Bensberg

Hans-Joerg Leu

Jochen Becker

Carsten Mueller

Mihnea Andrei

Dirk Thomsen

Thorsten Glebe

Yong Sik Kwon

Michael Muehle

Meinolf Block

Martin Heidel

Lars Fricke

Sascha Zorn

Beomsoo Kim

Myung Sun Park

Martin Schindewolf

Christoph Hohner

Patrick Voelker

Martin Kittel

Holger Mack

Fabian Garagnon

Sergej Hardock

Andreas Hartel

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

A node type of a plurality of distributed nodes to which a table to be added to a distributed database should be assigned can be identified by applying a set of placement rules defined for the table. The set of placement rules can also be applied to determine whether the table should be partitioned into more than one partition. A table group name associated with the table can be obtained and used in conjunction with the node type and determination of whether to partition the table to store the table in the distributed database on at least one node of the plurality of nodes as one or more partitions.

Table placement in distributed databases

Tables in a distributed database can require redistribution, for example to provide improved collocation of tables or table partitions that require joining at a node of multiple nodes across which the distributed database is distributed. Based at least in part on a set of table redistribution parameters, a table redistribution plan can be generated to include redistribution of a table from a first node to a second node. The set of table redistribution parameters can include a grouping parameter indicating at least one other table with which the table should be collocated. The table redistribution plan can be executed to cause the moving of the table from the first node to the second node.

Table redistribution in distributed databases

Growing community of inventors

Rauenberg, Germany

Johannes Beigel