skip to main content
10.1145/1376616.1376723acmconferencesArticle/Chapter ViewAbstractPublication PagesmodConference Proceedingsconference-collections
research-article

A case for flash memory ssd in enterprise database applications

Published:09 June 2008Publication History

ABSTRACT

Due to its superiority such as low access latency, low energy consumption, light weight, and shock resistance, the success of flash memory as a storage alternative for mobile computing devices has been steadily expanded into personal computer and enterprise server markets with ever increasing capacity of its storage. However, since flash memory exhibits poor performance for small-to-moderate sized writes requested in a random order, existing database systems may not be able to take full advantage of flash memory without elaborate flash-aware data structures and algorithms. The objective of this work is to understand the applicability and potential impact that flash memory SSD (Solid State Drive) has for certain type of storage spaces of a database server where sequential writes and random reads are prevalent. We show empirically that up to more than an order of magnitude improvement can be achieved in transaction processing by replacing magnetic disk with flash memory SSD for transaction log, rollback segments, and temporary table spaces.

References

  1. Hal Berenson, Philip A. Bernstein, Jim Gray, Jim Melton, Elizabeth J. O'Neil, and Patrick E. O'Neil. A Critique of ANSI SQL Isolation Levels. In Proceedings of the ACM SIGMOD, pages 1--10, San Jose, CA, May 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Andrew Birrell, Michael Isard, Chuck Thacker, and Ted Wobbe. A Design for High-Performance Flash Disks. Technical Report MSR-TR-2005-176, Microsoft Research, December 2005.Google ScholarGoogle Scholar
  3. Transaction Processing Performance Council. TPC Benchmark. http://www.tpc.org/.Google ScholarGoogle Scholar
  4. David J. DeWitt, Randy H. Katz, Frank Olken, Leonard D. Shapiro, Michael Stonebraker, and David A. Wood. Implementation Techniques for Main Memory Database Systems. In Proceedings of the ACM SIGMOD, pages 1--8, Boston, MA, June 1984. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Eran Gal and Sivan Toledo. Mapping Structures for Flash Memories: Techniques and Open Problems. In International Conference on Software - Science, Technology & Engineering (SwSTE'05), Herzelia, Israel, February 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Goetz Graefe. Sort-Merge-Join: An Idea Whose Time Has(h) Passed? In Proceedings of ICDE, pages 406--417, Houston, TX, February 1994. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Goetz Graefe. The Five-minute Rule Twenty Years Later, and How Flash Memory Changes the Rules. In Third International Workshop on Data Management on New Hardware (DAMON2007), Beijing, China, June 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Goetz Graefe, Ann Linville, and Leonard D. Shapiro. Sort versus Hash Revisited. IEEE Transactions on Knowledge and Data Engineering, 6(6):934--944, December 1994. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Jim Gray. Rules of Thumb in Data Engineering. In Proceedings of ICDE, pages 3--12, San Diego, CA, March 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Jim Gray and Bob Fitzgerald. Flash Disk Opportunity for Server-Applications. http://www.research.microsoft.com/~gray, January 2007.Google ScholarGoogle Scholar
  11. Chang-Gyu Hwang. Nanotechnology Enables a New Memory Growth Model. Proceedings of the IEEE, 91(11):1765--1771, November 2003.Google ScholarGoogle ScholarCross RefCross Ref
  12. Intel. Understanding the Flash Translation Layer (FTL) Specification. Application Note AP-684, Intel Corporation, December 1998.Google ScholarGoogle Scholar
  13. Edmond Lau and Samuel Madden. An Integrated Approach to Recovery and High Availability in an Updatable, Distributed Data Warehouse. In Proceedings of VLDB, pages 703--714, Seoul, Korea, September 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Sang-Won Lee and Bongki Moon. Design of Flash-Based DBMS: An In-Page Logging Approach. In Proceedings of the ACM SIGMOD, pages 55--66, Beijing, China, June 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. David B. Lomet, Roger S. Barga, Mohamed F. Mokbel, German Shegalov, Rui Wang, and Yunyue Zhu. Transaction Time Support Inside a Database Engine. In Proceedings of ICDE, pages 35--44, Atlanta, GA, April 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. David T. McWherter, Bianca Schroeder, Anastassia Ailamaki, and Mor Harchol-Balter. Priority Mechanisms for OLTP and Transactional Web Applications. In Proceedings of ICDE, pages 535--546, Boston, MA, March 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Oracle. Oracle Flashback Technology. http://www.oracle.com/technology/deploy/-availability/htdocs/Flashback_Overview.htm, 2007.Google ScholarGoogle Scholar
  18. Chanik Park, Prakash Talawar, Daesik Won, MyungJin Jung, JungBeen Im, Suksan Kim, and Youngjoon Choi. A High Performance Controller for NAND Flash-based Solid State Disk (NSSD). In The 21st IEEE Non-Volatile Semiconductor Memory Workshop (NVSMW), Monterey, CA, February 2006.Google ScholarGoogle ScholarCross RefCross Ref
  19. David A. Patterson. Latency Lags Bandwidth. Communications of the ACM, 47(10):71--75, October 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. Michael Stonebraker. The Design of the POSTGRES Storage System. In Proceedings of VLDB, pages 289--300, Brighton, England, September 1987. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. Michael Stonebraker, Samuel Madden, Daniel J. Abadi, Stravros Harizopoulos, Nabil Hachem, and Pat Helland. The End of an Architectural Era (It's Time for a Complete Rewrite). In Proceedings of VLDB, pages 289--300, Vienna, Austria, September 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. Theo Härder and Andreas Reuter. Principles of Transaction-Oriented Database Recovery. ACM Computing Survey, 15(4):287--317, December 1983. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. Kimberly L. Tripp and Neal Graves. SQL Server 2005 Row Versioning-based Transaction Isolation. Microsoft SQL Server Technical article, July 2006.Google ScholarGoogle Scholar
  24. Chi Zhang, Xiang Yu, Arvind Krishnamurthy, and Randolph Y. Wang. Configuring and Scheduling an Eager-Writing Disk Array for a Transaction Processing Workload. In FAST02, January 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. A case for flash memory ssd in enterprise database applications

    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
    • Published in

      cover image ACM Conferences
      SIGMOD '08: Proceedings of the 2008 ACM SIGMOD international conference on Management of data
      June 2008
      1396 pages
      ISBN:9781605581026
      DOI:10.1145/1376616

      Copyright © 2008 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 9 June 2008

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article

      Acceptance Rates

      Overall Acceptance Rate785of4,003submissions,20%

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader