Sap Se

Holger Bischoff

Christian Bensberg

Martin Heidel

Lars Fricke

Edward-Robert Tyercha

Joern Schmidt

SungGun Jung

Yuchon Yi

Robert Schulze

Andreas Tonder

Neeraj Kulkarni

Katrin Eisenreich

A system includes reception of a database query, the query comprising a first query statement to insert rows of a source table into a target table, generation a second query statement and a third query statement based on the first query statement, the second query statement to insert rows of a first partition of the source table into the target table and the third query statement to insert rows of a second partition of the source table into the target table, generation of a first query operator executable to perform the second query statement, generation of a second query operator executable to perform the third query statement, transmission of the first executable query operator to a second database server node storing the first partition of the source table, and transmission of the second executable query operator to a third database server node storing the second partition of the source table.

Parallel partition-wise insert sub-select

Disclosed herein are system, method, and computer program product embodiments for creating a dictionary-free index. An embodiment operates by a database maintaining database table comprises a column and a row. The database creates a concatenated string index comprising a concatenated string value based on the database column's row. The database also creates a hash value list having a hash value based on the concatenation string index's concatenated string value. Thereafter, the database creates a directory having a pointer to (i) a row position of the hash value list or (ii) a row position of a collision list having the row position of the hash value in the hash value list. The database also creates a collision list containing the row positions of the hash values occurring multiple times in the hash value list. The index for the database table includes the hash value list, the directory, and the collision list.

Hash composite indexes

A first store and a second store can be configured to store a first partition of a table of a database and a second partition of the table of the database, respectively. A database management system can be configured to at least update at least a first portion of the first partition where the update includes an update to a first primary key column in the first partition and verify that the first primary key column is unique across the first partition and the second partition. A first row having a first primary key value of the first primary key column from the first partition can be deleted, when the first primary key value in the first partition conflicts with a second primary key value of a second primary key column in the second partition.

Synchronized updates across multiple database partitions

An update to a partitioning column for a partitioned table in a database can be performed by handling rows for which the update will not require moving to a different partition separately (e.g. 'locally') for each partition followed by re-inserting those rows that will require moving to a different partition and deleting them from the original partition. The re-inserted rows are directed to a correct partition by application of the partitioning criteria for the table. Methods, articles, and systems are described.

Updating a partitioning column

The present disclosure involves systems, software, and computer implemented methods for generating a hash identifier. One example method includes: identifying a record to include in a table, the record associated with two or more primary key fields that are concatenated to create a concatenated key, wherein the table includes one or more hash columns for storing hash identifiers; applying a hash function to the concatenated key to create a new hash value; determining whether a record in the table has a hash value matching the new hash value; in response to determining that a hash value of a record matches the new hash value and the concatenated key of the identified record does not match the concatenated key of any existing record, adding a counter to the new hash value to generate a unique hash ID; and storing the record, including the unique hash ID, in the table.

Growing community of inventors

Dielheim, Germany

Holger Bischoff