A new external sorting algorithm with no additional disk space

Adnan, Nasim; Islam, Nazmul; Hossen, S K. Sharafat

doi:10.1016/s0020-0190(03)00201-1

Cited by 6 publications

(17 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, because the size limit of main memory, a large file can not be sorted in main memory so that the external merge sort in disk-based storage systems has been studied extensively. Many previous research [1,2,3] has been proposed for the external merge sort in disk-based storage systems. Because the external merge sort in disk-based storage systems might incur a lot of data access, the external sorting design on flash-based storage systems will be different from the implementations and considerations on disk-based storage systems.…”

Section: Motivationmentioning

confidence: 99%

Data sorting in flash memory

2012

Proceedings of the 27th Annual ACM Symposium on Applied Computing

View full text Add to dashboard Cite

Since huge-capacity flash memory is now an economic solution for various portable devices and enterprise systems, a NAND flash-based storage system has replaced a hard-disk drive in many applications. Recently, the implementation of database systems on NAND flash-based storage systems has become an important research topic. In particular, the external sorting is an important operation on database systems. With the very distinctive characteristics of flash memory, the typical external sorting that adopts a clustered sorting could result in performance degradation and reduce the reliability of flash memory. In the paper, we will propose an unclustered sorting that considers flash-memory characteristics. According to the experimental results, the improve ratio of the execution time and the energy consumption can be about 25%.

show abstract

Section: Motivationmentioning

confidence: 99%

Data sorting in flash memory

2012

Proceedings of the 27th Annual ACM Symposium on Applied Computing

View full text Add to dashboard Cite

show abstract

“…Dufrene and Lin (1992) proposed an algorithm in which no external file is needed; only the original file is used. Islam et al (2003) proposed an algorithm that uses no extra disk space and faster than the algorithm proposed by Dufrene and Lin, but the output complexity is more than that of proposed by Dufrene and Lin. Here we proposed an external sorting algorithm with no additional disk space, which uses special inplace merging technique.…”

Section: Introductionmentioning

confidence: 99%

“…Here we proposed an external sorting algorithm with no additional disk space, which uses special inplace merging technique. The basic idea of our algorithm is based on the algorithm proposed by Dufrene and Lin (1992) and Islam et al (2003). We have analyzed the I/O and time complexities of the proposed algorithm and the algorithm proposed by Dufrene and Lin algorithm as well as the algorithm proposed by Islam et al (2003).…”

Section: Introductionmentioning

confidence: 99%

“…The basic idea of our algorithm is based on the algorithm proposed by Dufrene and Lin (1992) and Islam et al (2003). We have analyzed the I/O and time complexities of the proposed algorithm and the algorithm proposed by Dufrene and Lin algorithm as well as the algorithm proposed by Islam et al (2003). We have shown that the I/O complexities of the proposed algorithm is less than that of Islam et al (2003) algorithm as well as Dufrene and Lin algorithm and the time complexity of the proposed algorithm is less than that of Dufrene an Lin algorithm.…”

Section: Introductionmentioning

confidence: 99%

“…There are many external sorting algorithms (Dufrene et al, 1992;Islam et al, 2003;Leu et al, 2000;Wegner et al 1989;Nodine et al, 1995). However, two algorithms such as, algorithm proposed by Dufrene and Lin (1992) and the algorithm proposed by Islam et al (2003) do not need additional disk space. On the other hand these two algorithms were designed based on generalization of bubble sort.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

In-Place Merging and External Sorting Algorithm With No Additional Disk Space

et al. 2022

View full text Add to dashboard Cite

The performance of external sorting mainly depends on its I/O and time complexities. In this paper we represent a more efficient external sorting algorithm with no additional disk space. This algorithm uses Quick sort to produce runs in the first phase. It uses special in-place merging technique in the second phase. The algorithm excels in sorting a huge file, which is larger than the available internal memory of the computer. The algorithm creates no backup file for manipulating huge records. Usually the external sorting algorithm needs additional disk space in merging phase. This algorithm saves disk space, since it does not use any backup file or additional disk space. Here we have briefly reviewed the external sorting algorithms, which do not use additional disk space. The I/O and time complexities of the proposed algorithm are analyzed and compared with that of other similar algorithms. We have found that the I/O complexity of the proposed algorithm is less than that of other similar algorithms (algorithms which do not need additional disk space) with the same time complexity.

show abstract