The system and methods disclosed herein relate to an improvement in automated data tiering technology. The systems and methods disclosed herein enhance database storage performance characteristics in myriad ways. First, the speed with which data can be relocated from one tier to another in a tiered data storage system is increased by reducing the number of sort cycles required to perform data relocation. In addition, data relocation among the tiers is performed on the backend by an offload engine, which results in uninterrupted access to read/write commands within the data storage system from a user's perspective on the frontend. Third, users are able to adjust the percentages of hot or cold data that are relocated within the database without having to alter the service level agreements. In this way, users can make spontaneous changes to performance characteristics related to the promotion and demotion of data stored within a tiered data storage system.

The system and methods disclosed herein relate to an improvement in automated data tiering technology. The systems and methods disclosed herein enhance database storage performance characteristics in myriad ways. First, the speed with which data can be relocated from one tier to another in a tiered data storage system is increased by reducing the number of sort cycles required to perform data relocation. In addition, data relocation among the tiers is performed on the backend by an offload engine, which results in uninterrupted access to read/write commands within the data storage system from a user's perspective on the frontend. Third, users are able to adjust the percentages of hot or cold data that are relocated within the database without having to alter the service level agreements. In this way, users can make spontaneous changes to performance characteristics related to the promotion and demotion of data stored within a tiered data storage system.

A computer-implemented method, system and computer program product for identifying an appropriate contact across collaborative applications. Contact information is collected from monitored messages, communication lists and contact lists in each collaborative application. Contact records are generated based on the collected contact information, where such records are inserted into a contact list. After receiving a query from a user containing a keyword(s) that include a nickname (or portion thereof) of a second user whom the user desires to interact via the current collaborative application, a search is performed in the contact list for any record containing a nickname that is similar to the provided keyword(s). Record(s) in the contact list containing a nickname that exceeds a threshold degree of similarity as the keyword(s) are identified. Such identified records may contain a user identifier which is used to identify the appropriate nickname of the second user associated with the current collaborative application.

The present disclosure discloses systems and methods for storing data records of a table or any data collection in a database system. The records are stored in a plurality of data files on a computer server. The system considers both the sequential I/O and random I/O options in the processing writing data records to a disk, and finds the best approach to writing data to the disk. Under certain conditions, the method analyzes and recognizes that sequential I/O may perform better. Under another condition, the method analyzes and recognize random I/O may perform better. Under other conditions, the method analyzes and recognizes a combination of sequential I/O and random I/O may perform better. The method chooses the option that has the minimum-cost for storing data records in a disk file. In doing so, the method considers and applies system constraints, such as memory resource and I/O latency.

The present disclosure discloses systems and methods for storing data records of a table or any data collection in a database system. The records are stored in a plurality of data files on a computer server. The system considers both the sequential I/O and random I/O options in the processing writing data records to a disk, and finds the best approach to writing data to the disk. Under certain conditions, the method analyzes and recognizes that sequential I/O may perform better. Under another condition, the method analyzes and recognize random I/O may perform better. Under other conditions, the method analyzes and recognizes a combination of sequential I/O and random I/O may perform better. The method chooses the option that has the minimum-cost for storing data records in a disk file. In doing so, the method considers and applies system constraints, such as memory resource and I/O latency.

The present disclosure provides a method/system for managing experimental data, a computer readable storage medium, and a device. The method includes: recording the managing experimental data, and preprocessing the experimental data, to obtain at least two preprocessed experimental arrays; selecting one element from each of two selected preprocessed experimental arrays according to an analysis requirement, and combining the elements to form a cyclic experimental database, the cyclic experimental database including a plurality of combination data; performing cyclic statistical analysis on the combination data in the cyclic experimental database, to obtain a cyclic statistical result corresponding to retrieved combination data.

The present disclosure provides a method/system for managing experimental data, a computer readable storage medium, and a device. The method includes: recording the managing experimental data, and preprocessing the experimental data, to obtain at least two preprocessed experimental arrays; selecting one element from each of two selected preprocessed experimental arrays according to an analysis requirement, and combining the elements to form a cyclic experimental database, the cyclic experimental database including a plurality of combination data; performing cyclic statistical analysis on the combination data in the cyclic experimental database, to obtain a cyclic statistical result corresponding to retrieved combination data.

A method may include receiving a database command to sort an unsorted dataset; dividing a sort operation, for sorting the unsorted dataset, into a plurality of portions; performing a first portion of the sort operation; persisting intermediate results from the first portion of the sort operation; and persisting a state of the sort operation identifying the portions of the sort operation have been performed.

A method may include receiving a database command to sort an unsorted dataset; dividing a sort operation, for sorting the unsorted dataset, into a plurality of portions; performing a first portion of the sort operation; persisting intermediate results from the first portion of the sort operation; and persisting a state of the sort operation identifying the portions of the sort operation have been performed.

A merge sort accelerator (MSA) includes a pre-processing stage configured to receive an input vector and generate a pre-processing output vector based on a pre-processing instruction and the input vector. The MSA also includes a merge sort network having multiple sorting stages configured to be selectively enabled. The merge sort network is configured to receive the pre-processing output vector and generate a sorted output vector based on a sorting instruction and the pre-processing output vector. The MSA includes an accumulator stage configured to receive the sorted output vector and update an accumulator vector based on the accumulator instruction and the sorted output vector. The MSA also includes a post-processing stage configured to receive the accumulator vector and generate a post-processing output vector based on a post-processing instruction and the accumulator vector.