Abstract: Data can be stored in a memory for in-memory processing system such the data is available for processing as soon as it is needed to be processed. By way of example, first portion and a second portion of the data can be stored in the memory of the in-memory processing system for processing by the in-memory processing system, such that the second portion of the data is stored in the memory before the in-memory processing system completes the processing of the first portion of the data, thereby allowing the in-memory processing system to process the second portion of the data when the processing system is able to process the second portion of the data. Those skilled in the art will appreciate that this processing can, for example, be achieved by providing an execution plan that includes one or more components configured to faceplate storing data in the memory of an in-memory processing system, such the data is available for processing as soon as it is needed to be processed by the in-memory processing system.

Abstract: Techniques for improving complex database queries are provided. A determination is made whether to adopt a static or dynamic query execution plan based on metrics. When the dynamic query execution plan is used, a request fragment of the request is planned and the corresponding plan fragment is executed. The processed fragment provides feedback related to its processing to the remaining request and the process is repeated on the remaining request until the request is completed.

Abstract: Probabilistic record linking methods and a system are provided. Selections are acquired; the selections identify the two data sources, column identifiers from each of the two data sources, pairs of column identifiers from each of the two data sources, a confidence values for matching each record associated with each pair. The selections are used to compare data housed in the two data sources. Based on the comparison, matched records and non matched records are identified from the two data sources.

Abstract: A method and system for rebuilding data following a disk failure within a RAID storage system. The rebuild process keeps track of the relative number of READ operations across a RAID group so that following a RAID disk failure, the most frequently read areas of the RAID group can be rebuilt before less frequently accessed areas. Host READs to the rebuilt area will no longer necessitate on-the-fly rebuild from parity data, and thus host performance will be much less impacted than with prior rebuild processes.

Abstract: A method for cleansing product demand data to improve product demand forecasting. The improved data cleansing methodology enhances product weekly demand forecast accuracy by adjusting stock-out week demand values, and employing separate outlier logic for regular and promotional demand periods.

Abstract: Errors that can be detected as a result of the mapping of transmission data from its physical form back to its logical form can be considered in addition to the errors detected by using an error detection technique (e.g., a conventional CRC technique), thereby allowing fewer error detection/recovery bits (error recovery data or bits) to be used as would be possible by using the error detection technique alone. In other words, less error recovery data would be needed to achieve a given level accuracy using conventional techniques. As a result, overhead associated with adding error detection/recovery bits can be reduced.

Abstract: Techniques for data modeling are provided. Enterprise data is organized into reference data for entities that an enterprise wants to track and monitor. Relationship data is created that establishes relationships among the various entities within the enterprise data. The reference data and the relationship data are published within an enterprise data warehouse for accessing the enterprise data.

Abstract: Storage devices and components, including memory components (e.g., non-volatile memory) can be trained by executable code that facilitates and/or performs reads and/or write requests to one or more storage sub-modules of a storage component (e.g., memory configured on a memory channel) made up of multiple storage components (e.g., DIMMs). The executable code can also train multiple storage components at the same time and/or in parallel.

Abstract: Techniques for transitioning between code-based and data-based execution forms (or models) are disclosed. The techniques can be used to improve the performance of computing systems by allowing the execution to transition from one of the execution models to another one of the execution models that may be more suitable for carrying out the execution or effective processing of information in a computing system or environment. The techniques also allow switching back to the previous execution model when that previous model is more suitable than the execution model currently being used. In other words, the techniques allow transitioning (or switching) back and forth between a data-based and code-based execution (or information processing) models.

Abstract: Techniques for mapping a virtual R-Tree to an extensible-hash based file system for databases are provided. Spatial data is identified within an existing file system, which stores data for a database. Rows of the spatial data are organized into collections; each collection represents a virtual block. The virtual blocks are used to form an R-Tree spatial index that overlays an existing index for the database on the existing file system. Each row within its particular virtual block includes a pointer to its native storage location within the existing file system.

Abstract: A system, method, and computer-readable medium that facilitate dynamic skew avoidance are provided. The disclosed mechanisms advantageously do not require any statistic information regarding which values are skewed in a column on which a query is applied. Query selectivity is evaluated at a check point and thereby facilitates accurate detection of an overloaded processing module. The successful detection of an overloaded processing module causes other processing modules to stop sending more skewed rows to the overloaded processing module. Detection of an overloaded processing module is made when the overloaded processing module has received more rows than a target number of rows. Further, skewed rows that are maintained locally rather than redistributed to a detected processing module may result in more processing modules becoming overloaded. Advantageously, the disclosed mechanisms provide for a final redistribution adjustment to provide for even distribution of rows among all processing modules.

Abstract: A system, method, and computer-readable medium that facilitate counting the number of distinct values in several columns of a table utilizing parallel aggregation mechanisms.

Abstract: A method and system for managing operational states of database tables within a multiple-database system. If a particular user session issues a query against a target table that causes a data inconsistency, the target table transitions into an errant state and the session will become interrupted. This errant state is then propagated onto any other table associated with the user session. A session-level recovery process can thereafter be executed to repair and restore database tables associated with the interrupted user sessions without the need to take an entire database system offline.

Abstract: A database system includes an optimizer to generate resource estimates regarding execution of a request in the database system, and a regulator to monitor execution of a request and to adjust a priority level of the request based on the monitored execution and based on the resource estimates provided by the optimizer. The regulator is executable to further feed back statistics regarding execution of the request to the optimizer to improve accuracy of resource estimates provided by the optimizer.

Abstract: Techniques for data assignment from an external distributed file system (DFS) to a database management system (DBMS) are provided. Data blocks from the DFS are represented as first nodes and access module processors of the DBMS are represented as second nodes. A graph is produced with the first and second nodes. Assignments are made for the first nodes to the second nodes based on evaluation of the graph to integrate the DFS with the DBMS.

Abstract: Techniques for accessing a parallel database system via an external program using vertical and/or horizontal partitioning are provided. An external program to a database management system (DBMS) configures external mappers to process a specific portion of query results on specific access module processors of the DBMS that are to house query results. The query is submitted by the external program to the DBMS and the DBMS is directed to organize the query results in a vertical or horizontal manner. Each external mapper accesses its portion of the query results for processing in parallel on its designated AMP or set of AMPS to process the query results.

Abstract: There is provided a method, a system and a machine readable medium to optimize storage allocation in a database management system. The method comprises receiving a processing step at a step processing module of an access module processor from a dispatcher module. The method further comprises determining whether a fast access storage flag is set in the processing step, the fast access storage flag indicating use of an intermediate file in fast access storage to store one or more redistributed data rows of a table of a database that is distributed across one or more storage devices of the database management system; Yet further the method comprises selectively allocating a free fast access storage data block to the intermediate file from a fast access storage pool based on the determination that the fast access storage flag is set. Lastly, the method comprises writing a redistributed data row from the one or more redistributed data rows to the allocated fast access storage data block.

Abstract: Techniques for data store list generation and management are provided. A user supplies criteria for a list via a graphical user interface tool. The criteria are used to generate a query, and the query when executed against a data store produces results representing the list. The list may then be used for a variety of purposes.

Abstract: Several methods and a system of a workload management of a concurrently accessed database server are disclosed. In one embodiment, a method includes applying a weight to a service class. The method also includes generating a priority of the service class. In addition, the method includes selecting a group based on the weight of the service class. The method further includes determining a priority level based on the priority of the service class. The method also includes generating a characteristic of a shadow process through the weight and the priority of the service class. In addition, the method includes executing a query.

Abstract: A system and method for using failure casting to manage failures in computer system. In accordance with an embodiment, the system uses a failure casting hierarchy to cast failures of one type into failures of another type. In doing this, the system allows incidents, problems, or failures to be cast into a (typically smaller) set of failures, which the system knows how to handle. In accordance with a particular embodiment, failures can be cast into a category that is considered reboot-curable. If a failure is reboot-curable then rebooting the system will likely cure the problem. Examples include hardware failures, and reboot-specific methods that can be applied to disk failures and to failures within clusters of databases. The system can even be used to handle failures that were hitherto unforeseen failures can be cast into known failures based on the failure symptoms, rather than any underlying cause.