CINXE.COM

<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd"> <html xmlns="http://www.w3.org/1999/xhtml"> <head> <meta http-equiv="Content-Type" content="text/html; charset=utf-8" /> <title>ComSIS | Computer Science and Information Systems</title> <link rel="stylesheet" type="text/css" href="res/style1.css" /> </head> <body> <script type="text/javascript" src="res/wz_tooltip.js"></script> <script type="text/javascript" src="res/slide.js"></script> <div id="all"> <div id="header"> <h1>Computer Science and Information Systems</h1> </div>  <div id="main"> <div id="sidebar"> <p>About the journal</p> <ul> <li><a href="index.php">Home page</a></li> <li><a href="contact.php">Contact information</a></li> <li><a href="aims.php">Aims and scope</a></li> <li><a href="indexing.php">Indexing information</a></li> <li><a href="policies.php">Editorial policies</a></li> <li><a href="consortium.php">ComSIS consortium</a></li> <li><a href="boards.php">Journal boards</a></li> <li><a href="managing.php">Managing board</a></li> </ul> <p>For authors</p> <ul> <li><a href="information.php">Information for contributors</a></li> <li><a href="http://ojs.pmf.uns.ac.rs/index.php/comsis">Paper submission</a></li> <li><a href="submission.php">Article submission through OJS</a></li> <li><a href="copyright.php">Copyright transfer form</a></li> <li><a href="download.php">Download section</a></li> </ul> <p>For readers</p> <ul> <li><a href="archive.php?show=lstnew">Forthcoming articles</a></li> <li><a href="archive.php?show=vol2104">Current issue</a></li> <li><a href="archive.php">Archive</a></li> </ul> <p>For reviewers</p> <ul> <li><a href="http://ojs.pmf.uns.ac.rs/index.php/comsis">View and review submissions</a></li> </ul> <p>News</p> <ul> <li><a href="https://www.facebook.com/ComSISJournal/"> <img src="res/fb.png" alt="FB"/> Journal's Facebook page</a></li> <li><a href="cfp.php">Calls for special issues</a></li> <li><a href="notification.php">New issue notification</a></li> </ul> </div>  <div id="content">  <h1 class="title">A Flash-Aware Buffering Scheme with the On-the-Fly Redo for Efficient Data Management in Flash Storage</h1><p class="authors">Kyosung Jeong<sup>1</sup>, Sungchae Lim<sup>2</sup>, Kichun Lee<sup>3</sup> and Sang-Wook Kim<sup>4</sup></p><ol><li>Dept. of Computer and Software, Hanyang University, Korea<br/>ksjeong@saltlux.com</li><li>Dept. of Computer Science, Dongduk Women’s University, Korea<br/>sclim@dongduk.ac.kr</li><li>Dept. of Industrial Engineering, Hanyang University, Korea<br/>skylee@hanyang.ac.kr</li><li>Dept. of Computer and Software, Hanyang University, Korea<br/>wook@hanyang.ac.kr</li></ol><h3>Abstract</h3><p>Thanks to remarkably fast random reads and rapidly decreasing prices per bit, flash storage has been regarded as a promising alternative to traditional hard disk drives (HDDs). Although flash storage has many distinguished hardware features, it still suffers from the poor I/O performance in the case of update operations. Due to the absence of in-place updates, differently from HDDs, flash storage needs to modify data through out-of-place updates. For this reason, it is required to continuously renew the mapping information between a logical page address and its new physical address, invalidating its old physical address. When the invalidated pages swallow most of free space in flash storage, the actions of garbage reclamation are needed. Since the actions of garbage reclamation are very costly, it is crucial to reduce the number of update operations for the use of flash storage in enterprise-scale database systems. In this light, we propose a new buffering scheme that evicts dirty pages without writing them to storage, thereby reducing the amount of update operations considerably. That is, our buffering scheme enables the flushing-less evictions of dirty pages. To correctly read a page undergoing its flushing-less eviction, we propose a new on-the-fly redo mechanism that enables restoring the lost updates of the page in normal database processing. For fast execution of the on-the-fly redo, we maintain memory-resident log data of a reasonable size. To show the performance advantages of the proposed scheme, we performed extensive experiments based on the TPC-C benchmark, by running them on the open-sourced Berkeley DB equipped with/without our scheme. The results show that our scheme yields a much better performance by reducing the amount of page updates significantly.</p><h3>Key words</h3><p>flash storage, buffering scheme, database system, recovery</p><h3>Digital Object Identifier (DOI)</h3><p><a href="https://doi.org/369–392">https://doi.org/369–392</a></p><h3>Publication information</h3><p><a href="/archive.php?show=vol1402">Volume 14, Issue 2 (June 2017)</a><br/>Year of Publication: 2017<br/>ISSN: 2406-1018 (Online)<br/>Publisher: ComSIS Consortium</p><h3>Full text</h3><p><a class="download" href="pdf.php?id=601-1608"><img class="left" src="res/pdf.png" alt="Download"/>Available in PDF<br/><em>Portable Document Format</em></a></p><h3>How to cite</h3><p>Jeong, K., Lim, S., Lee, K., Kim, S.: A Flash-Aware Buffering Scheme with the On-the-Fly Redo for Efficient Data Management in Flash Storage. Computer Science and Information Systems, Vol. 14, No. 2. (2017), https://doi.org/369–392</p>  </div>  </div>  <div id="footer_top"> </div> <div id="footer"> <div class="left">Faculty of Sciences, Trg Dositeja Obradovića 3, 21000 Novi Sad, Serbia, <a href="mailto:comsis@uns.ac.rs">comsis@uns.ac.rs</a></div> <div class="left">Published by ComSIS Consortium under<br/><a rel="license" href="http://creativecommons.org/licenses/by-nc-nd/4.0/">Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License<br><img alt="Creative Commons License" style="border-width:0" src="https://i.creativecommons.org/l/by-nc-nd/4.0/88x31.png"/></a></div> <div class="clearer"> </div> </div>  </div>  </body> </html>