Skip to main navigation Skip to search Skip to main content

Modification of Parallelization for Fast Sort Algorithm

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Citation (Scopus)

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.

Original languageEnglish
Title of host publicationInformation and Software Technologies - 24th International Conference, ICIST 2018, Proceedings
EditorsRobertas Damasevicius, Giedre Vasiljeviene
PublisherSpringer Verlag
Pages270-278
Number of pages9
ISBN (Print)9783319999715
DOIs
Publication statusPublished - 2018
Event24th International Conference on Information and Software Technologies, ICIST 2018 - Vilnius, Lithuania
Duration: 4 Oct 20186 Oct 2018

Publication series

NameCommunications in Computer and Information Science
Volume920
ISSN (Print)1865-0929

Conference

Conference24th International Conference on Information and Software Technologies, ICIST 2018
Country/TerritoryLithuania
CityVilnius
Period4/10/186/10/18

Keywords

  • Analysis of computer algorithms
  • Data mining
  • Data sorting
  • Parallel algorithm

ASJC Scopus subject areas

  • General Computer Science
  • General Mathematics

Fingerprint

Dive into the research topics of 'Modification of Parallelization for Fast Sort Algorithm'. Together they form a unique fingerprint.

Cite this