Abstract | ||
---|---|---|
One of the most important issues in NoSQL databases is to develop applications and facilitates for the parallel processing in information systems. In the work the author presents some improvements for the parallel algorithm for merging strings and use this algorithm to sort large data sets. Tested sorting for a parallel merging algorithm confirms the reduction of the time complexity and improved stability of the algorithm. |
Year | DOI | Venue |
---|---|---|
2018 | 10.1007/978-3-319-99972-2_21 | Communications in Computer and Information Science |
Keywords | Field | DocType |
Parallel algorithm,Data sorting,Data mining,Analysis of computer algorithms | Information system,Data set,Parallel algorithm,Computer science,Parallel computing,sort,Sorting,NoSQL,Time complexity,Sorting algorithm | Conference |
Volume | ISSN | Citations |
920 | 1865-0929 | 0 |
PageRank | References | Authors |
0.34 | 12 | 1 |
Name | Order | Citations | PageRank |
---|---|---|---|
Zbigniew Marszalek | 1 | 31 | 5.95 |