Benchmark Tests on Improved Merge for Big Data Processing
- Publication Type:
- Conference Proceeding
- Proceedings - 2015 Asia-Pacific Conference on Computer-Aided System Engineering, APCASE 2015, 2015, pp. 96 - 101
- Issue Date:
Files in This Item:
|Benchmark Tests on Improved Merge for Big Data Processing.pdf||Published version||378.12 kB|
Copyright Clearance Process
- Recently Added
- In Progress
- Open Access
This item is open access.
© 2015 IEEE. 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.
Please use this identifier to cite or link to this item: