skip to main content
research-article

Flashing up the storage layer

Published:01 August 2008Publication History
Skip Abstract Section

Abstract

In the near future, commodity hardware is expected to incorporate both flash and magnetic disks. In this paper we study how the storage layer of a database system can benefit from the presence of both kinds of disk. We propose using the flash and the magnetic disk at the same level of the memory hierarchy and placing a data page to only one of these disks according to the workload of the page. Pages with a read-intensive workload are placed on the flash disk, while pages with a write-intensive workload are placed on the magnetic disk. We present a family of on-line algorithms to decide the optimal placement of a page and study their theoretical properties. Our system is self-tuning, i.e., our algorithms adapt page placement to changing workloads. We also present a buffer replacement policy that takes advantage of the asymmetric I/O properties of the two types of storage media to reduce the total I/O cost. Our experimental evaluation shows remarkable I/O performance improvement over both flash-only and magnetic-only systems. These results, we believe, exhibit both the potential and necessity of such algorithms in future database systems.

References

  1. A. Birrell et al. A design for high-performance flash disks. SIGOPS Oper. Syst. Rev., 41(2), 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. D. L. Black and D. D. Sleator. Competitive algorithms for replication and migration problems. Technical Report CMU-CS-89-201, 1989.Google ScholarGoogle Scholar
  3. A. Borodin, N. Linial, and M. E. Saks. An optimal on-line algorithm for metrical task systems. J. ACM, 39(4), 1992. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. T.-S. Chung et al. System software for flash memory: A survey. In EUC, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Fusion-IO, Inc. The ioDrive. http://fusionio.com.Google ScholarGoogle Scholar
  6. G. Graefe. Query Evaluation Techniques for Large Databases. ACM Comput. Surv., 25(2), 1993. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. G. Graefe. The five-minute rule twenty years later, and how flash memory chenges the rules. DAMON, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. J. Kim et al. A space-efficient flash translation layer for compactflash systems. Transactions on Consumer Electronics., 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. S.-W. Lee and B. Moon. Design of flash-based DBMS: An in-page logging approach. In SIGMOD, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. S.-W. Lee et al. A log buffer-based flash translation layer using fully-associative sector translation. Trans. on Embedded Computing Sys., 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Microsoft Corp. Windows Vista Operating System: ReadyBoost.Google ScholarGoogle Scholar
  12. S. Nath and A. Kansal. FlashDB: Dynamic Self-Tuning Database for NAND Flash. In IPSN, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. M. Stonebraker. Operating system support for database management. Commun. ACM, 24(7):412--418, 1981. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. J. Westbrook. Randomized algorithms for multiprocessor page migration. In DIMACS Series in Discrete Mathematics and Theoretical Computer Science, volume 7, pages 135--150, 1992.Google ScholarGoogle Scholar
  15. Wikipedia. Hybrid drive. http://en.wikipedia.org/wiki/Hybrid_drive.Google ScholarGoogle Scholar
  16. Wikipedia. Multi level cell. http://en.wikipedia.org/wiki/Multi-level_Cell.Google ScholarGoogle Scholar
  17. C.-H. Wu, T.-W. Kuo, and L. P. Chang. An efficient b-tree layer implementation for flash-memory storage systems. Trans. on Embedded Computing Sys., 6(3), 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Flashing up the storage layer

                    Recommendations

                    Comments

                    Login options

                    Check if you have access through your login credentials or your institution to get full access on this article.

                    Sign in

                    Full Access

                    PDF Format

                    View or Download as a PDF file.

                    PDF

                    eReader

                    View online with eReader.

                    eReader