| Patent application number | Description | Published |
| 20080235183 | Workload Aware Checking of Database Reorganization - The present solution addresses the need to carry out reorganization of a database storage. A statistics-based reorganization check procedure is performed on at least first database tables and indexes, resulting in a preliminary reorganization recommendation. Information on workload on tables and indexes of said database storage is received. Based on the information on workload and the preliminary reorganization recommendation, it is decided whether to carry out reorganization of the database storage in accordance with the preliminary reorganization recommendation. | 09-25-2008 |
| 20090182766 | AVOIDING DATABASE RELATED JOINS WITH SPECIALIZED INDEX STRUCTURES - Provided is a solution for storing data, the data comprising a set of tables, each table comprising a set of columns, each column comprising a set of values, each value being one or more data types. In the solution, a binary tree can be created for each of the data types. Each binary tree can comprise a set of nodes. A set of arrays can be associated with each node of the binary tree. The array associated with each node of each binary tree can correspond to one of the columns that comprises the value of the data type represented by the node of the binary tree. Each array can indicate at least one table row and column from the plurality of tables in which the value of the data type represented by the node of the binary tree occurs. | 07-16-2009 |
| 20090210445 | METHOD AND SYSTEM FOR OPTIMIZING DATA ACCESS IN A DATABASE USING MULTI-CLASS OBJECTS - Methods for optimizing data access in a row-oriented relational database containing data sets having attributes using a computer are presented the method including: causing a computer to analyze a database workload to determine an access frequency for each of the attributes; causing the computer to assign each of the attributes to a priority classes corresponding with the access frequency, where the priority classes include a higher priority class and a lower priority class, and where a higher priority class corresponds with a higher access frequency and a lower priority class corresponds with a lower access frequency; causing the computer to store the attributes in accordance with the classes, where the attributes assigned to the higher priority class are stored in a high priority storage medium, and where the attributes assigned to a lower priority class are stored in a low priority storage medium. | 08-20-2009 |
| 20100250517 | SYSTEM AND METHOD FOR PARALLEL COMPUTATION OF FREQUENCY HISTOGRAMS ON JOINED TABLES - According to one embodiment of the present invention, a method for the parallel computation of frequency histograms in joined tables is provided. The method includes reading data in a table row-by-row from a database system using a coordinator unit and distributing each read row to separate worker units. Each worker unit computes a partial frequency histogram for each column in the table in parallel. The partial histograms from the worker units are then merged and the coordinator unit sends the merged frequency histograms to the worker units. | 09-30-2010 |