Modification of Parallelization of Modified Merge Sort Algorithm

An important issue in sorting large data sets in the NoSQL databases is the ability to sort process parallelism in order to accelerate the application. The work presents the use of the parallelized method for merging strings in a modified merge sort algorithm. The static tests of the proposed sort algorithm verify the stability and the theoretical time complexity of the method.