Sap Se

Carsten Thiel

Guenter Radestock

Rolando Blanco

Bernhard Scheirle

Mihnea Andrei

Colin Florendo

Martin Heidel

Ivan Schreter

Anil Kumar Goel

Thomas Legler

Robert Schulze

Andreas Tonder

Joern Schmidt

Gerd Ritter

Michael Muehle

Sebastian Seifert

Muhammed Sharique

Chaitanya Gottipati

Christian Lemke

Vivek Kandiyanallur

Peter Steinemann

Sarika Iyer

Surendra Vishnoi

Martin Richtarsky

Stephan Kottler

Jörn Schmidt

A method may include receiving a first transaction inserting a record into a database and a second transaction deleting the record from the database. A validity period for the record may be determined based on a first commit time at which the first transaction is committed and a second commit time at which the second transaction is committed. A current table and/or a history table of a system versioned table may be updated to include the record based on the validity period of the record. One or more temporal operations may be performed based on the system versioned table. For example, a time travel operation may be performed to retrieve, based on the system versioned table, one or more records that are valid at a given point in time. Related systems and computer program products are also provided.

System versioned table with transactional system time

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

Objects across multiple database manipulation language (DML) redo log records are cached, during continuous replay of redo log records on a secondary system, for the same table partition to enable reuse of such cached objects. Later, these cached objects can be reused as they are accessed during the sequential processing of DML redo records for a specific table partition.

Caching DML statement context during asynchronous database system replication

A system includes storage, in a volatile random access memory, of a first data block comprising an array of distinct values of a database table column, and first header data comprising a first pointer to the first data block, determination of a memory size associated with the first header data and the first data block, allocation of a first memory block of the non-volatile random access memory based on the determined memory size, determination of an address of the non-volatile random access memory associated with the allocated first memory block, and writing of an indicator of the number of distinct values of the array and a binary copy of the first data block at the address of the non-volatile random access memory.

Storage of database dictionary structures in non-volatile memory

A system in which first header data and a first logical array are stored in a volatile random access memory, the first logical array stored in a first contiguous memory block, with each array position of the first logical array representing a position in a database table and storing a value identifier of a value associated with the position in the database table, and with the first header data indicating a number of bits used to encode the value identifiers and comprising a first pointer to the first contiguous memory block. A memory size associated with the first header data and the first contiguous memory block is determined, a first memory block of the non-volatile random access memory is allocated based on the determined memory size, an address of the non-volatile random access memory associated with the allocated first memory block is determined, and the number of bits and a binary copy of the first contiguous memory block are written at the address of the non-volatile random access memory.

Storage of database column data in non-volatile memory

A system in which first header data, second header data, a first logical array and a second logical array are stored in volatile random access memory. Each array position of the first logical array represents an identifier of a database column value and stores an offset value associated with an array position of the second logical array, and each array position of the second logical array stores a row position of the database column value. A memory size associated with the first header data, the second header data, the first logical array and the second logical array is determined, a first memory block of a non-volatile random access memory is allocated based on the determined memory size, an address of the non-volatile random access memory associated with the allocated first memory block is determined, and a portion of the first header data, a portion of the second header data, a binary copy of the first logical array and a binary copy of the second logical array are written at the address of the non-volatile random access memory.

Storage of an inverted index in non-volatile memory

A system includes a volatile random access memory storing first header data and a first data block, the first header data including descriptive information and a first pointer to the first data block, and a non-volatile random access memory. The system includes determination of a memory size associated with the first header data and the first data block, allocation of a first memory block of the non-volatile random access memory based on the determined memory size, determination of an address of the non-volatile random access memory associated with the allocated first memory block, and writing of the descriptive information and a binary copy of the first data block at the address of the non-volatile random access memory.

Storage of data structures in non-volatile memory

The disclosure generally describes computer-implemented methods, computer-program products, and systems for modeling and deploying decision services. One computer-implemented method includes during uptime processing: generating at least one shadow database table corresponding to a new business object (BO) persistency model, establishing change recording for at least one database table associated with an old BO persistency model, retrieving, as changed data and using at least one computer, changed BO data from the at least one database table, transforming, as transformed data, the changed data to correspond to the new BO persistency model, writing the transformed data to the generated at least one shadow database table, and retrieving, as further changed data, BO data from the at least one database table upon a determination that the BO data has changed in the at least one database table after a prior retrieval of the BO data from the at least one database table.

Migration of business object data in parallel with productive business application usage

Growing community of inventors

Heidelberg, Germany

Carsten Thiel