Abstract
Because flash memory now provides an economical solution for various portable devices and embedded systems, an NAND flash-based storage system has replaced the hard disk drive in many applications. Recently, the implementation of database systems using an NAND flash-based storage system has become an important research topic. In particular, the external sorting is an important operation in database systems. With the very distinctive characteristics of flash memory, the typical external sorting system that adopts a clustered sorting process can result in performance degradation and reduce the reliability of flash memory. In this article, we will propose an unclustered sorting method that considers the unique characteristics of flash memory, and we then propose a decision rule to exploit the advantages of both clustered and unclustered sorting. The decision rule can separate records according to their record length, sort them appropriately by the clustered and unclustered sorting, and merge the sorted results. The experimental results show that the proposed method can improve performance in an NAND flash-based storage system (i.e., solid-state drive).
- Simona Boboila and Peter Desnoyers. 2011. Performance models of flash-based solid-state drives for real workloads. In Proceedings of the IEEE Symposium on Mass Storage Systems and Technologies (MSST). Google Scholar
Digital Library
- Tyler Cossentine and Ramon Lawrence. 2013. Efficient external sorting on flash memory embedded devices. International Journal of Database Managemen Systems (IJDMS) 5, 1 (2013), Article No. 1.Google Scholar
- Peter Desnoyers. 2014. Analytic models of SSD write performance. ACM Transactions on Storage (TOS) 10, 2 (2014), Article No. 8. Google Scholar
Digital Library
- Samsung Electronics. 2011. NAND Flash-Memory Datasheet and SmartMedia Data Book.Google Scholar
- Fpers. 2015. Retrieved from http://www.myflorida.com/dmsweb/411/fpers.dat.Google Scholar
- Goetz Graefe. 2006. Implementing sorting in database systems. Computer Surveys 38, 3 (2006), Article No. 10. Google Scholar
Digital Library
- Donald E. Knuth. 1998. Art of Computer Programming. Addison-Wesley. Google Scholar
Digital Library
- Per-Ake Larson. 2003. External sorting: Run formation revisited. IEEE Transactions on Knowledge and Data Eng. 15, 4 (2003), 961--972. Google Scholar
Digital Library
- Per-Åke Larson and Goetz Graefe. 1998. Memory management during run generation in external sorting. ACM SIGMOD Record 27, 2 (1998), 472--483. Google Scholar
Digital Library
- Sang-Won Lee, Dong-Joo Park, Tae-Sun Chung, Dong-Ho Lee, Sangwon Park, and Ha-Joo Song. 2007. A log buffer-based flash translation layer using fully-associative sector translation. ACM Transactions on Embedded Computing Systems 6, 3 (2007), Article No. 18. Google Scholar
Digital Library
- Xiqing Li, Gordon Linoff, Stephen J. Smith, Craig Stanfill, and Kurt Thearling. 1993. A practical external sort for dhared disk MPPs. In Proceedings of the ACM/IEEE Conference on Supercomputing. 666--675. Google Scholar
Digital Library
- Track Metadata. 2015. Million Song Dataset. Retrieved from http://labrosa.ee.columbia.edu/millionsong/pages/getting-dataset.Google Scholar
- Hyoungmin Park and Kyuseok Shim. 2009. FAST: Flash-aware external sorting for mobile database systems. Journal of Systems and Software 82, 8 (2009), 1298--1312. Google Scholar
Digital Library
- Raghu Ramakrishnan and Johannes Gehrke. 2003. Database Management Systems. McGraw-Hill. Google Scholar
Digital Library
- Betty Salzberg, Alex Tsukerman, Jim Gray, Michael Stuewart, Susan Uren, and Bonnie Vaughan. 1990. A distributed single-input single-output external sort. In Proceedings of the ACM SIGMOD Conference. 94--101. Google Scholar
Digital Library
- Chin-Hsien Wu. 2012. Data sorting in flash memory. In Proceedings of the ACM Symposium on Applied Computing (SAC). 1847--1849. Google Scholar
Digital Library
- John Yiannis and Justin Zobel. 2007. Compression techniques for fast external sorting. International Journal on Very Large Data Bases 16, 2 (2007), 269--291. Google Scholar
Digital Library
- Weiye Zhang and Per-Ake Larson. 1997. Dynamic memory adjustment for external mergesort. In Proceedings of the 23rd International Conference on Very Large Data Bases (VLDB). 376--385. Google Scholar
Digital Library
Index Terms
Data Sorting in Flash Memory
Recommendations
Data sorting in flash memory
SAC '12: Proceedings of the 27th Annual ACM Symposium on Applied ComputingSince 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 ...
Next high performance and low power flash memory package structure
In general, NAND flash memory has advantages in low power consumption, storage capacity, and fast erase/write performance in contrast to NOR flash. But, main drawback of the NAND flash memory is the slow access time for random read operations. Therefore,...
NAND flash memory system based on the Harvard buffer architecture for multimedia applications
The main purpose of this research is to design a new memory architecture for NAND flash memory to provide XIP (execute in place) for code execution as well as overcome the biggest bottleneck for data execution. NOR flash for multimedia application is ...






Comments