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 a...
Saved in:
Published in | Information and Software Technologies pp. 428 - 440 |
---|---|
Main Authors | , |
Format | Book Chapter |
Language | English |
Published |
Cham
Springer International Publishing
|
Series | Communications in Computer and Information Science |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | 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. |
---|---|
ISBN: | 9783030302740 3030302741 |
ISSN: | 1865-0929 1865-0937 |
DOI: | 10.1007/978-3-030-30275-7_33 |