A data filtering system, a data selection method, and a state prediction system are provided. The state prediction system includes the data filtering system and a predictive model generation system. The data filtering system includes a data pre-processing device and a property selection device. The data pre-processing device transforms first sample data corresponding to a first detection property into first feature parameters, transforms second sample data corresponding to a second detection property into second feature parameters, and transforms third sample data corresponding to a third detection property into third feature parameters. The property selection device selects at least two of the detection properties according to the first feature parameters, the second feature parameters, and the third feature parameters. Then, the predictive model generation system trains a predictive model based on the at least two detection properties selected by the property selection device.

A data filtering system, a data selection method, and a state prediction system are provided. The state prediction system includes the data filtering system and a predictive model generation system. The data filtering system includes a data pre-processing device and a property selection device. The data pre-processing device transforms first sample data corresponding to a first detection property into first feature parameters, transforms second sample data corresponding to a second detection property into second feature parameters, and transforms third sample data corresponding to a third detection property into third feature parameters. The property selection device selects at least two of the detection properties according to the first feature parameters, the second feature parameters, and the third feature parameters. Then, the predictive model generation system trains a predictive model based on the at least two detection properties selected by the property selection device.

A technique is described for merging multiple lists of ordinal elements such as keys into a sorted output. In an example embodiment, a merge window is defined, based on the bounds of the multiple lists of ordinal elements, that is representative of a portion of an overall element space associated with the multiple lists. Lists of elements to be sorted can be placed into one of at least two different heaps based on whether they overlap the merge window. For example, lists that overlap the merge window may be placed into an active or “hot” heap, while lists that do not overlap the merge window may be placed into a separate inactive or “cold” heap. A sorted output can then be generated by iteratively processing the active heap. As the processing of the active heap progresses, the merge window advances, and lists may move between the active and inactive heaps.

Optimized techniques are disclosed for sorting variable-length records using an optimized amount of memory while maintaining good locality of references. The amount of memory required for sorting the variable length records is optimized by reusing some of the memory used for storing the variable length records being sorted. Pairs of input runs storing variable length records may be merged into a merged run that contains the records in a sorted order by incrementally scanning, sorting, and copying the records from the two input runs being merged into memory pages of the merged run. When all the records of a memory page of an input run have been processed or copied to the merged run, that memory page can be emptied and released to a cache of empty memory pages. Memory pages available from the cache of empty memory pages can then be used for generating the merged run.

Optimized techniques are disclosed for sorting variable-length records using an optimized amount of memory while maintaining good locality of references. The amount of memory required for sorting the variable length records is optimized by reusing some of the memory used for storing the variable length records being sorted. Pairs of input runs storing variable length records may be merged into a merged run that contains the records in a sorted order by incrementally scanning, sorting, and copying the records from the two input runs being merged into memory pages of the merged run. When all the records of a memory page of an input run have been processed or copied to the merged run, that memory page can be emptied and released to a cache of empty memory pages. Memory pages available from the cache of empty memory pages can then be used for generating the merged run.

Provided are a computer program product, system, and method for selecting a plurality of processing systems to sort a data set. A determination is made of processing systems to perform a sort of records in a data set. The data set is divided into data subsets, each data subset comprising a portion of the records of the data set. Each of the determined processing systems of is notified of a data subset to sort. In response to receiving notification from the determined processing systems that the records in the data subsets have been sorted, the sorted data subsets are merged into a sorted data set comprising the records of the data set sorted.

Provided are a computer program product, system, and method for selecting a plurality of processing systems to sort a data set. A determination is made of processing systems to perform a sort of records in a data set. The data set is divided into data subsets, each data subset comprising a portion of the records of the data set. Each of the determined processing systems of is notified of a data subset to sort. In response to receiving notification from the determined processing systems that the records in the data subsets have been sorted, the sorted data subsets are merged into a sorted data set comprising the records of the data set sorted.

Disclosed are various embodiments for validating documents using a blockchain data. Multiple documents can be included in the validation process using a merge and hash process and a summary terms document. Validation can be performed by hashing and merging operations, followed by comparing hash values.

Disclosed are various embodiments for validating documents using a blockchain data. Multiple documents can be included in the validation process using a merge and hash process and a summary terms document. Validation can be performed by hashing and merging operations, followed by comparing hash values.

A computer-implemented method is provided for performing bitonic merge operations. The computer-implemented includes receiving a plurality of first values in a first hardware register from a first input stream in ascending order, receiving a plurality of second values in a second hardware register from a second input stream in descending order, performing a bitonic merge operation on the first and second values in the first and second hardware registers, and reversing comparison operations performed by one or more comparators in the bitonic merge operation, outputs of the one or more comparators being loaded into the second hardware register so that output values of the second hardware register are arranged in descending order and placed into an output stream.