Benchmark Tests on Improved Merge for Big Data Processing
Zbigniew Marszałek, Marcin Woźniak, Grzegorz Borowik, Raniyah Wazirali, Christian Napoli, Giuseppe Pappalardo, Emiliano Tramontana · 2015
Computer scientists and engineers work with increasing amounts of information. These data are used for knowledge retrieval, data management decision support and so on. Sorting algorithms are important procedures that if efficiently composed and implemented can increase speed of data processing and decision correctness. Many various sorting algorithms and their modifications are applicable in large computer systems. However, as the computer architectures are more efficient with each release and the software is more complex with each version there is need to improve sorting methods applied for big data computation.