Universiti Teknologi Malaysia Institutional Repository

A Faster External Sorting Algorithm Using No Additional Disk Space

Islam, Md. Rafiqul and Md. Sap, Mohd. Noor and Sarker, Md. Sumon and Islam, Sk. Razibul (2006) A Faster External Sorting Algorithm Using No Additional Disk Space. Jurnal Teknologi Maklumat, 18 (2). pp. 47-59. ISSN 0128-3790

[img] PDF
177Kb

Abstract

The effective performance of the external sorting is analyzed in terms of both time and I/O complexities. This paper is concerned with a more efficient external sorting algorithm, where both the time and I/O (read and write) complexities have been reduced. The proposed method is a hybrid technique that uses quick sort and merge sort in two distinct phases. Both the time and I/O complexities of the proposed algorithm are analyzed here and compared with the complexities of the existing similar algorithms. The proposed algorithm uses special in-place merging technique, which creates no extra backup file for manipulating huge records. For this, the algorithm saves huge disk space, which is needed to hold the large file. This also reduces time complexity and makes the algorithm faster.

Item Type:Article
Uncontrolled Keywords:complexity, external sorting, in-place merging, quick sort, runs
Subjects:Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Divisions:Computer Science and Information System (Formerly known)
ID Code:3283
Deposited By: Mrs Rozilawati Dollah @ Md Zain
Deposited On:22 May 2007 06:28
Last Modified:01 Jun 2010 03:08

Repository Staff Only: item control page