On preprocessing large data sets by the use of triple merge sort algorithm

DAWID, POLAP and MARCIN, WOZNIAK and ZBIGNIEW, MARSZALEK (2014) On preprocessing large data sets by the use of triple merge sort algorithm. In: International Conference on Advances in Information Processing and Communication Technology - IPCT 2014, 07- 08 June,2014, Rome, Italy.

[img]
Preview
Text
20140712_051306.pdf - Published Version

Download (872kB) | Preview
Official URL: https://www.seekdl.org/conferences/paper/details/3...

Abstract

This paper illustrates 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.

Item Type: Conference or Workshop Item (Paper)
Uncontrolled Keywords: computer algorithm, data mining, sorting algorithm, analysis of computer algorithms
Depositing User: Mr. John Steve
Date Deposited: 20 May 2019 12:09
Last Modified: 20 May 2019 12:09
URI: http://publications.theired.org/id/eprint/2528

Actions (login required)

View Item View Item