| Patent application number | Description | Published |
|---|
| 20090198738 | System and Method for an Adaptive List Prefetch - A method, system, and computer program product are provided for retrieving records into a main memory. A first number of gaps and a first total gap size are received for a list of records from a database subsystem. A determination is made of a first average gap size using the first number of gaps and the first total gap size. A determination is made as to whether the first average gap size is greater than a prestaging threshold value. Responsive to the first average gap size being equal to or less than the prestaging threshold value, a prestaging flag is set for the list of records. Then, the list of records is retrieved into the main memory using prestaging. | 08-06-2009 |
| 20100042607 | METHOD, APPARATUS, AND COMPUTER PROGRAM PRODUCT FOR ADAPTIVE QUERY PARALLELISM PARTITIONING WITH LOOK-AHEAD PROBING AND FEEDBACK - A database query is partitioned into an initial partition including a plurality of parallel groups, and is executed, via an execution plan, based on the initial partition. A sampling subset of data is identified from the plurality of parallel groups. Substantially in parallel with the executing of the query, the execution plan is executed on the sampling subset of data as a sampling thread. The execution plan is modified based on feedback from the execution of the execution plan on the sampling subset of data. | 02-18-2010 |
| 20100042624 | METHOD FOR SORTING DATA - Techniques for sorting a sequence of one or more input objects are provided. The techniques include identifying a property that is exhibited by a sequence of one or more input objects, determining whether each input object from the sequence of one or more input objects exhibits the property, storing each of the one or more input objects into a buffer, wherein an input object is stored in a first buffer if it exhibits the property and an input object is stored in a second buffer if it does not exhibit the property, sorting each of the one or more input objects in each buffer, and merging the one or more input objects in each buffer into a sequence of one or more input objects. | 02-18-2010 |
| 20100042631 | METHOD FOR PARTITIONING A QUERY - Techniques for partitioning a query are provided. The techniques include establishing one or more criterion for partitioning a query, wherein the query comprises one or more tables, materializing a first of the one or more tables, partitioning the first of the one or more tables until the one or more criterion have been satisfied, and partitioning and joining a remainder of the one or more tables of the query. | 02-18-2010 |
| 20100223269 | SYSTEM AND METHOD FOR AN EFFICIENT QUERY SORT OF A DATA STREAM WITH DUPLICATE KEY VALUES - An apparatus and method for efficiently performing a query sort on a data set with duplicate key values is disclosed. The method includes identifying unique key values for a key in a data set after determining that a number of duplicate key values for the key exceed a predefined threshold. The method also includes recording an association of each unique key value with a record in the data set and sorting unique key values. The method further includes storing the unique key values in a sorted order, wherein each unique key value is associated with an appropriate record in the data set. | 09-02-2010 |
| 20110022815 | STORAGE ALLOCATION - Techniques for storage allocation of a data record are provided. The techniques include attempting to identify a first location for storing a data record, wherein the data record comprises one or more data record attributes, if the first location is identified, selecting the first location for storing the data record, and if the first location is not identified, identifying a second location for storing the data record using a cost penalty function and selecting the second location for storing the data record based on the cost penalty function. | 01-27-2011 |
| 20110196857 | Generating Materialized Query Table Candidates - Techniques for generating a set of one or more materialized query table (MQT) candidates for a workload are provided. The techniques include receiving a workload, wherein the workload comprises a set of one or more queries, generating one or more best matching MQTs (BMQTs) based on one or more query blocks of the one or more queries by removing syntax that is not qualified for a MQT re-write, determining one or more frequently used multi-joins in the workload, using the one or more BMQTs and the one or more frequently used multi-joins to generate a set of one or more workload MQTs (WMQTs), and grouping one or more WMQTs and one or more BMQTs into one or more groups to merge into a set of a smaller number of MQTs and to cover the workload. | 08-11-2011 |
| Patent application number | Description | Published |
|---|
| 20080243660 | METHOD AND SYSTEM FOR FORECASTING USING AN ONLINE ANALYTICAL PROCESSING DATABASE - A method (and system) for providing a forecast, the method including providing a multi-dimensional database storing data at a lowest level in a first dimension, calculating a first forecast at a level that is higher than the lowest level of a first dimension in the database, calculating a forecast for each category within the lowest level of the first dimension, aggregating a second forecast across all categories at the lowest level of the first dimension based upon an aggregation of the calculated forecasts for each category within the lowest level of the first dimension, determining a difference between the first forecast and the second forecast, and storing the difference in a dummy category at the lowest level of the first dimension. | 10-02-2008 |
| 20090088658 | METHOD AND SYSTEM FOR SUBJECT-ADAPTIVE REAL-TIME SLEEP STAGE CLASSIFICATION - A method of subject-adaptive, real-time sleep stage classification to classify electroencephalogram sleep recordings into sleep stages to determine whether a subject exhibits a sleep disorder includes performing subject adaptation to improve classification accuracy for a new subject with limited training data, the performing subject adaptation comprises using linear-chain conditional random fields and potential functions, training the linear-chain conditional random fields using the training data, continuously receiving the electroencephalogram waves, continuously extracting features from the electroencephalogram waves, the extracting features comprising transforming each of the electroencephalogram waves to capture information embedded in the electroencephalogram waves, and continuously classifying the sleep stages according to extracted features and learned parameters from the linear-chain conditional random fields. | 04-02-2009 |
