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: 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.

Abstract: Techniques for management of data in multi-storage systems allow managing storage of data in a first storage of multiple storages in a multi-storage system based on the temperature of the data (or data temperature) obtained for a second storage of the multiple storages in a multi-storage system. For example, in a multi-storage system that includes at least one non-volatile storage (e.g., one or more HDDs) and at least one volatile storage (e.g., a cache memory device), the storage of a particular data portion (e.g., a storage unit of data) for the at least one volatile storage can be managed based on a temperature of the data determined for the non-volatile storage. By way of example, persistent temperatures used for management of data in a non-volatile storage system (e.g., a multi-tier storage of a database system) can be used to effectively manage the storage of the data in a cache memory that is typically provided for improving performance by keeping data that is likely to be used in the cache memory.

Abstract: Techniques for management of data in multi-storage systems allow managing storage of data in one of the multiple storages (e.g., a HDD) based on the information associated with the storage and/or access of data (e.g., logical hits of data in a cache memory) in another one of the storages (e.g., a cache memory) of the multi-storage system. In one aspect, information associated with storage and/or access of data in a volatile (or non-persistent) storage environment is provided for managing the storage of data in a non-volatile (or persistent) storage environment. By way of example, data access information associated with a volatile storage environment (e.g., logical hits of data in a cache) can be effectively communicated to a non-volatile storage environment, for example, as information that can be indicative of data temperatures. Moreover, the information obtained from a non-volatile storage environment can be persistently stored for and/or in the non-volatile environment (e.g.

Abstract: A method and apparatus are provided for facilitating performance monitoring of a large database system. The apparatus comprises a processor and a storage device communicatively coupled with the processor. The processor is programmed to (i) retrieve resource usage data points, (ii) calculate an outlier threshold value based upon values of data points, and (iii) determine if the value of each data point is outside of the threshold value. The processor is further programmed to (iv) plot the value of the data point in histogram with a first color when the data point value is determined to be outside of the threshold value, (v) plot the data point value in histogram with a second color when the data point value is determined to be not outside of the threshold value, and (vi) display the histogram containing plotted data point values of the first color and plotted data point values of the second color to enable a user to quickly and easily identify a potential skew condition.

Abstract: A combination of non-persistent-based and persistent-based schemes are used to effectively manage volatile storages which are conventionally managed solely by using non-persistent schemes (e.g., LRU schemes in cache memory). Generally, the persistent-based schemes can be based on persistent information associated with a non-volatile storage environment (e.g., persistent data temperatures associated with data stored in non-volatile storages). In this context, a persistent-based scheme can, for example, be effectively used in addition or combination with a conventional scheme provided for volatile memory. By way of example, a LRU scheme can be combined with a scheme based on persistent data temperatures in order to more effectively manage cache memory provided to enhance the performance of a system. As another example, a LRU, a LFU aging schemes can be combined with a scheme based on persistent data temperatures.

Abstract: Database values and their associated indicators can be arranged in multiple “buckets.” Adjacent buckets can be combined into a single bucket successively based one or more criteria associated with the indicators to effectively reduce the number of buckets until a desired number is reached.

Abstract: A memory channel can be divided into two or more memory sub-channels, wherein each one of the memory sub-channels includes two or more memory components configured to store data made accessible on that memory sub-channel, and wherein the two or more memory components in each one of the memory sub-channels are respectively connected via at least one transmission line and can be individually accessed (addressed) on their associated sub-channel.

Abstract: As an abstract representation, a set of equivalent logical structures representative of multiple execution plans for execution of a database query can be used to optimize a database query. A logical structure can include one or more logical operators each representing multiple physical operators for executing the database query. Group and Operator Rules can be applied as rules to the set of equivalent logical structures to obtain additional equivalent logical structures and logical operator until no additional logical operators can be obtained. A set of possible implementation plans for the total number of the obtained logical operators can be obtained, for example, based on physical and/or implementation context.

Abstract: Embodiments of the present invention provide hardware-friendly indexing of databases. In particular, forward and reverse indexing are utilized to allow for easy traversal of primary key to foreign key relationships. A novel structure known as a hit list also allows for easy scanning of various indexes in hardware. Group indexing is provided for flexible support of complex group key definition, such as for date range indexing and text indexing. A Replicated Reordered Column (RRC) may also be added to the group index to convert random I/O pattern into sequential I/O of only needed column elements.

Abstract: As an abstract representation, a set of equivalent logical structures representative of multiple execution plans for execution of a database query can be used to optimize a database query. A logical structure can include one or more logical operators each representing multiple physical operators for executing the database query. Group and Operator Rules can be applied as rules to the set of equivalent logical structures to obtain additional equivalent logical structures and logical operator until no additional logical operators can be obtained. A set of possible implementation plans for the total number of the obtained logical operators can be obtained, for example, based on physical and/or implementation context.

Abstract: The execution of the one or more database queries can be optimized by using a multi-platform cost model that take into account the respective cost of execution in each one of the multiple execution platforms. The respective costs of the execution can, for example, include cost associated with one or more operators for executing the one or more database queries in each one of the multiple execution platforms and/or the costs of exchanging data between the multiple execution platforms.

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: 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 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: A database request can be processed at least partly based on one or more differences between multiple database systems and/or environments. The differences can, for example, include differences between one or more database capabilities respectively provided by the multiple database systems, differences between the representation of data in the multiple database systems, and differences in the interfaces for accessing the multiple database systems.

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: 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: 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.