Hasso-Plattner-Institut Fur Softwaresystemtechnik GmbH Patent applications |
Patent application number | Title | Published |
20150120698 | USING OBJECT AWARENESS FOR A JOIN PRUNING MECHANISM - The invention relates to a computer system and a corresponding method and a corresponding computer-readable medium according to the invention. The computer system is suitable for determining the result of a join. The computer system may be distributed system. The computer system comprises: a processing unit; a database coupled to the processing unit, the database comprising: a first table (R), and a second table (S), each of the first and second table being partitioned into at least two partitions, namely a respective first (R | 04-30-2015 |
20140310232 | AGGREGATE QUERY-CACHING IN DATABASES ARCHITECTURES WITH A DIFFERENTIAL BUFFER AND A MAIN STORE - 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 ( | 10-16-2014 |
20130232176 | Online Reorganization of Hybrid In-Memory Databases - A system and method that dynamically adapts to workload changes and adopts the best possible physical layout on the fly—while allowing simultaneous updates to the table. A process continuously and incrementally computes the optimal physical layout based on workload changes and determines whether or not switching to this new layout would be beneficial. The system can perform online reorganization of hybrid main memory databases with a negligible overheard, leading up to three orders of magnitude performance gains when determining the optimal layout of dynamic workloads and providing guarantees on the worst case performance of our system. | 09-05-2013 |
20130007847 | Communication Protocol for a Containment-Aware Discovery Service - In general, methods and apparatus, including computer program products, implementing and using techniques for providing a discovery service in a unique identifier network are described. Said discovery service is suitable for tracking and tracing a query item represented by a unique identifier in a unique identifier network. In particular, a communication protocol for a containment-aware discovery service is described. | 01-03-2013 |
20130007024 | Filter Method for a Containment-Aware Discovery Service - In general, methods and apparatus, including computer program products, implementing and using techniques for providing a discovery service in a unique identifier network are described. Said discovery service is suitable for tracking and tracing a query item represented by a unique identifier in a unique identifier network. In particular, a filter method for a containment-aware discovery service is described. | 01-03-2013 |
20130006989 | Search Method for a Containment-Aware Discovery Service - In general, methods and apparatus, including computer program products, implementing and using techniques for providing a discovery service in a unique identifier network are described. Said discovery service is suitable for tracking and tracing a query item represented by a unique identifier in a unique identifier network. In particular, a search method for a containment-aware discovery service is described. | 01-03-2013 |
20120265728 | Available-To-Promise on an In-Memory Column Store - 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. | 10-18-2012 |
20110161387 | Computer-Implemented Method for Operating a Database and Corresponding Computer-System - The invention relates to a computer-implemented method for operating a database comprising the step of updating a binary status of a tuple in the database. The binary status field either contains a null value or a time stamp. The update can be done in-place or by using an insert-only approach. | 06-30-2011 |
20110161379 | Lifecycle-Based Horizontal Partitioning - The invention relates to a computer-implemented method for dynamically and horizontally partitioning a table of a relational database, wherein the table comprises records, wherein the records are mapped to a plurality of states, wherein the table is horizontally partitioned into a plurality of partitions, and wherein the plurality of states is mapped to the plurality of partitions. The method comprises the steps of changing the assignment of a first record from a first state to a second state, wherein the first state is mapped to a first partition, wherein the second state is mapped to a second partition, wherein the first partition is not the second partition, and storing the first record in the second partition. The invention further relates to a computer system implementing the abovementioned method for dynamically and horizontally partitioning a table of a relational database. | 06-30-2011 |