Patent application number | Description | Published |
20090240663 | ETL-Less Zero-Redundancy System and Method for Reporting OLTP Data - In one embodiment the present invention includes a relational database management system component and a column-oriented data processing component. The relational database system component stores database information in a row format. The column-oriented data processing component stores the database information in a column format. In response to a database update request, the relational database management system component updates the database information stored in the row format; the relational database management system component notifies the column-oriented data processing component of the database update request; and the column-oriented data processing component updates the database information stored in said column format. In response to a query request, the column-oriented data processing component generates a query response based on the database information stored in said column format. In this manner, an embodiment of the present invention is able to generate up-to-date reports without the need for extraction, translation and loading procedures. | 09-24-2009 |
20100287145 | BUSINESS OBJECT BASED NAVIGATION - In one embodiment the present invention relates to a method for navigating within a database containing business objects. The method includes the steps of providing a preconfigured model comprising preconfigured business object types and preconfigured associations of the business object types, identifying a reference to a business object instance within a software object and determining a primary business object type corresponding to the business object instance, providing links to at least one secondary business object type associated with the primary business object type in accordance with the preconfigured business model, and retrieving from the database at least one attribute of at least one business object instance within the secondary business object type associated to the primary business object type in accordance with the preconfigured model. In this manner, a user may more easily navigate the database. | 11-11-2010 |
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 |
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 |
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 |
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 |
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 |
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 |
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 |
20140059232 | ROBUST TENANT PLACEMENT AND MIGRATION IN DATABASE-AS-A-SERVICE ENVIRONMENTS - A robust tenant placement and migration system, a process, and a respective controller for database-as-a-service environments are disclosed. Multiple tenants (T) are allocated on a set of in-memory database servers (S), such that workload changes depending on the tenants' behavior are considered, while maintaining strict service level objectives. The placement and migration are based on a migration command which, in turn, is based on an interleaved placement by interleaving tenants (T) across servers. | 02-27-2014 |
20140067752 | 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. | 03-06-2014 |
20140157370 | Transparent Control of Access Invoking Real-time Analysis of the Query History - The invention relates to a method for granting an inquirer querying a repository access to the repository, a communication protocol between a client and a server, and a system for controlling access of at least one inquirer to a repository. The repository typically stores event data relating to traceable products. The aspects according to teaching disclosed herein may be for example implemented as security extensions for existing repositories providing a finer granularity of access rights and means to prevent an exposure of data sets considered sensitive. The security extensions disclosed herein may be implemented to protect access to any kind of client/server application wherein the server is exposing sensitive data. | 06-05-2014 |
20140214333 | SYSTEM AND METHOD FOR GENOMIC DATA PROCESSING WITH AN IN-MEMORY DATABASE SYSTEM AND REAL-TIME ANALYSIS - A system and a method for analyzing and evaluating genome data in the course of personalized medicine. In-memory technology is provided for processing of genome data and its real-time analysis as a holistic process in the course of personalized medicine. The cloud application helps physicians and researchers to identify the genetic roots for certain tumor types in the treatment of diseases correlating to genomic variants or mutations, such as cancer diseases. The system combines the latest international research results with patient-specific genomic data while eliminating the need for long-lasting manual searches of all dispositions in distributed international research and literature data sources. | 07-31-2014 |
20140214334 | EFFICIENT GENOMIC READ ALIGNMENT IN AN IN-MEMORY DATABASE - A high performance, low-cost, gapped read alignment algorithm is disclosed that produces high quality alignments of a complete human genome in a few minutes. Additionally, the algorithm is more than an order of magnitude faster than previous approaches using a low-cost workstation. The results are obtained via careful algorithm engineering of the seeding based approach. The use of non-hashed seeds in combination with techniques from search engine ranking achieves fast cache-efficient processing. The algorithm can also be efficiently parallelized. Integration into an in-memory database infrastructure (IMDB) leads to low overhead for data management and further analysis. | 07-31-2014 |
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 |
20150058858 | DYNAMIC TASK PRIORITIZATION FOR IN-MEMORY DATABASES - The present invention provides methods and system, including computer program products, implementing and using techniques for providing tasks of different classes with access to CPU time provided by worker threads of a database system. In particular, the invention relates to such a database-system-implemented method comprising the following steps: inserting the tasks to a queue of the database system; and executing the tasks inserted to the queue by worker threads of the database system according to their order in the queue; characterized in that the queue is a priority queue; and in that the method further comprises the following steps: assigning each class to a respective priority; and in that the step of inserting the tasks to the queue includes: associating each task with the respective priority assigned to its class. | 02-26-2015 |