Analytical & empirical analysis of external sorting algorithms

Author

Malpani, Poonam ; Bassi, Paras

Author_Institution

Dept. of Comput. Sci., Swami Keshvanand Inst. of Technol., Jaipur, India

fYear

2014

fDate

5-6 Sept. 2014

Firstpage

1

Lastpage

6

Abstract

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.

Keywords

computational complexity; data compression; parallel processing; relational databases; sorting; OODBMS; ORDBMS; RDBMS; SIMD techniques; empirical analysis; external sorting algorithms; generate random testing; integer value; semicompression techniques; space complexity; time complexity; Arrays; Indexes; Partitioning algorithms; Relational databases; Sorting; Time complexity; Disk Striping; External Sorting; Insertion Sort; Randomized Quick Sort; SIMD; Semi-Compression Technique;

fLanguage

English

Publisher

ieee

Conference_Titel

Data Mining and Intelligent Computing (ICDMIC), 2014 International Conference on

Conference_Location

New Delhi

Print_ISBN

978-1-4799-4675-4

Type

conf

DOI

10.1109/ICDMIC.2014.6954224

Filename

6954224