On Preprocessing Large Data Sets by the Use of Triple Merge Sort Algorithm

Provided by: Seek Digital Library
Topic: Data Management
Format: PDF
In this paper, the authors illustrate preprocessing large data sets by the use of triple merge sort algorithm. Examined algorithm is oriented on large data sets and as research results have shown the version is about 15% faster than classic one. This feature may be crucial for efficiency in NoSQL database systems or other intelligent application operating on large data sets. In the paper is presented and discussed examined version. There are presented theoretical discussion and practical verification.

Find By Topic