Hasso-plattner-institut Fur Softwaresystemtechnik Gmbh

Stephan Mueller

Hasso Plattner

Alexander Zeier

Jens Krueger

Juergen Mueller

Sebastian Hillig

Christian Tinnefeld

Anisoara Nica

Christian Schwarz

The invention relates to a computer system for both online transaction processing and online analytical processing, comprising: a processor coupled to a database, the database comprising the database comprising: a main store () for storing records, a differential buffer () for receiving and buffering added or deleted or modified records, the differential buffer being coupled to the main store, a schema comprising records stored in the main store and records stored in the differential buffer, and a cache store () for caching a result of a query against the schema; and a cache controller () executable by the processor and communicatively coupled to the database, the cache controller being configured for: storing the result of the query in the cache store; receiving an analytical request; and determining, in response to the received request, an up-to-date result of the query by (): accessing the cache store to obtain the cached result; determining the records of the schema that have been added or deleted or modified since the step of storing the cached result in the cache store on the basis of the records stored in the differential buffer; and incrementally deriving the up-to-date result from the cached result and from the records determined in the previous step.

Aggregate query-caching in databases architectures with a differential buffer and a main store

The invention relates to a computer system and a corresponding method and a corresponding computer-readable medium. The computer system is suitable for determining the result of a join. Based on the access pattern of an application, the computer system infers that a particular subjoin is empty. The computer system then excludes the inferred-empty subjoin when performing the join, performing a more efficient and faster database join operation.

Using object awareness for a join pruning mechanism

A system and method of determining an earliest delivery date for a demand on the basis of a fact table stored in a database, where the demand indicates both a desired date and a desired quantity for items from a stock, where a fact time series is comprised by and/or deducible from the fact table, and where the fact time series comprises fact tuples indicating both a fact date and a change in quantity of stock items that occurred on this fact date. The method includes generating an aggregated time series from the fact time series by defining and/or obtaining discrete time intervals, and generating, for at least one discrete time interval, an aggregated tuple indicating both its corresponding discrete time interval and the aggregated change in quantity of stock items that occurred in its corresponding discrete time interval.

Available-to-promise on an in-memory column store

Growing community of inventors

Potsdam, Germany

Stephan Mueller