A Faster External Sorting Algorithm Using No Additional Disk Space
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 t...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Penerbit UTM Press
2006
|
| Subjects: | |
| Online Access: | http://eprints.utm.my/id/eprint/3283/1/047_MdRafiqulIslam_D06.pdf http://eprints.utm.my/id/eprint/3283/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | 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. |
|---|