Analytical & empirical analysis of external sorting algorithms

RDBMS, OODBMS & ORDBMS are used in the daily life to hold loads of data. The various systems uses various techniques to retrieve data, one of the important elements in these elements is the sorting. Various sorting techniques have been devised over the years. One of the many popular techniques is External Sorting. This paper is concerned of analyzing and improvising the algorithms in terms of Time and Space complexity. This paper discusses various factors on which time complexity and space complexity of external sorting depends. Results have been incurred using data sets of various sizes that are integer value of size 2 bytes. Also semi-compression and SIMD techniques are applied on the algorithm to generate random testing scenarios.