{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T16:39:09Z","timestamp":1761323949839},"reference-count":19,"publisher":"Association for Computing Machinery (ACM)","issue":"8","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2013,6]]},"abstract":"<jats:p>The use of flash-based solid state drives (SSDs) in storage systems is growing. Adding SSDs to a storage system not only raises the question of how to manage the SSDs, but also raises the question of whether current buffer pool algorithms will still work effectively. We are interested in the use of hybrid storage systems, consisting of SSDs and hard disk drives (HDDs), for database management. We present cost-aware replacement algorithms, which are aware of the difference in performance between SSDs and HDDs, for both the DBMS buffer pool and the SSDs. In hybrid storage systems, the physical access pattern to the SSDs depends on the management of the DBMS buffer pool. We studied the impact of buffer pool caching policies on SSD access patterns. Based on these studies, we designed a cost-adjusted caching policy to effectively manage the SSD. We implemented these algorithms in MySQL's InnoDB storage engine and used the TPC-C workload to demonstrate that these cost-aware algorithms outperform previous algorithms.<\/jats:p>","DOI":"10.14778\/2536354.2536355","type":"journal-article","created":{"date-parts":[[2014,6,24]],"date-time":"2014-06-24T12:17:57Z","timestamp":1403612277000},"page":"541-552","source":"Crossref","is-referenced-by-count":29,"title":["Hybrid storage management for database systems"],"prefix":"10.14778","volume":"6","author":[{"given":"Xin","family":"Liu","sequence":"first","affiliation":[{"name":"University of Waterloo, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kenneth","family":"Salem","sequence":"additional","affiliation":[{"name":"University of Waterloo, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,6]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"crossref","first-page":"1318","DOI":"10.14778\/1687553.1687557","article-title":"An object placement advisor for db2 using solid state storage","volume":"2","author":"Canim M.","year":"2009","journal-title":"Proc. VLDB Endow."},{"key":"e_1_2_1_2_1","doi-asserted-by":"crossref","first-page":"1435","DOI":"10.14778\/1920841.1921017","article-title":"Ssd bufferpool extensions for database systems","volume":"3","author":"Canim M.","year":"2010","journal-title":"Proc. VLDB Endow."},{"key":"e_1_2_1_3_1","first-page":"193","volume-title":"Proc. USENIX Symp. on Internet Technologies and Systems","author":"Cao P.","year":"1997"},{"key":"e_1_2_1_4_1","doi-asserted-by":"crossref","first-page":"1414","DOI":"10.14778\/1920841.1921015","article-title":"Flashstore: high throughput persistent key-value store","volume":"3","author":"Debnath B.","year":"2010","journal-title":"Proc. VLDB Endow."},{"key":"e_1_2_1_5_1","first-page":"1113","volume-title":"Proc. SIGMOD Int'l Conf. on Management of Data","author":"Do J.","year":"2011"},{"key":"e_1_2_1_6_1","unstructured":"Facebook. Facebook: FlashCache 2012. http:\/\/assets.en.oreilly.com\/1\/event\/45\/ Flashcache%20Presentation.pdf.  Facebook. Facebook: FlashCache 2012. http:\/\/assets.en.oreilly.com\/1\/event\/45\/ Flashcache%20Presentation.pdf."},{"key":"e_1_2_1_7_1","first-page":"61","volume-title":"Proc. the 1st USENIX FAST","author":"Forney B. C.","year":"2002"},{"key":"e_1_2_1_8_1","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1145\/1413254.1413264","article-title":"The five-minute rule 20 years later: and how flash memory changes the rules","volume":"6","author":"Graefe G.","year":"2008","journal-title":"Queue"},{"issue":"4","key":"e_1_2_1_9_1","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1145\/1413254.1413261","article-title":"Flash disk opportunity for server applications","volume":"6","author":"Gray J.","year":"2008","journal-title":"Queue"},{"issue":"11","key":"e_1_2_1_10_1","doi-asserted-by":"crossref","first-page":"1615","DOI":"10.14778\/2350229.2350274","article-title":"Flash-based extended cache for higher throughput and faster recovery","volume":"5","author":"Kang W.-H.","year":"2012","journal-title":"Proc. VLDB Endow."},{"key":"e_1_2_1_11_1","doi-asserted-by":"crossref","first-page":"514","DOI":"10.14778\/1453856.1453913","article-title":"Flashing up the storage layer","volume":"1","author":"Koltsidas I.","year":"2008","journal-title":"Proc. VLDB Endow."},{"key":"e_1_2_1_12_1","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1145\/1364782.1364796","article-title":"Flash storage memory","volume":"51","author":"Leventhal A.","year":"2008","journal-title":"Commun. ACM"},{"issue":"10","key":"e_1_2_1_13_1","doi-asserted-by":"crossref","first-page":"1076","DOI":"10.14778\/2336664.2336679","article-title":"hstorage-db: heterogeneity-aware data management to exploit the full capability of hybrid storage systems","volume":"5","author":"Luo T.","year":"2012","journal-title":"Proc. VLDB Endow."},{"key":"e_1_2_1_14_1","first-page":"13","volume-title":"Proc. ACM SIGMOD Int'l Conf. on Management of data","author":"Lv Y.","year":"2011"},{"key":"e_1_2_1_15_1","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1016\/0196-6774(90)90003-W","article-title":"Competitive algorithms for server problems","volume":"11","author":"Manasse M. S.","year":"1990","journal-title":"J. Algorithms"},{"key":"e_1_2_1_16_1","first-page":"939","volume-title":"Proc. ACM SIGMOD Int'l Conf. on Management of data","author":"Ozmen O.","year":"2010"},{"key":"e_1_2_1_17_1","unstructured":"The TPC-C Benchmark. http:\/\/www.tpc.org\/tpcc\/.  The TPC-C Benchmark. http:\/\/www.tpc.org\/tpcc\/."},{"key":"e_1_2_1_18_1","first-page":"161","volume-title":"Proc USENIX ATC","author":"Wong T. M.","year":"2002"},{"key":"e_1_2_1_19_1","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1007\/BF01189992","article-title":"The k-server dual and loose competitiveness for paging","volume":"11","author":"Young N.","year":"1994","journal-title":"Algorithmica"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/2536354.2536355","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T10:07:01Z","timestamp":1672222021000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/2536354.2536355"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6]]},"references-count":19,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2013,6]]}},"alternative-id":["10.14778\/2536354.2536355"],"URL":"https:\/\/doi.org\/10.14778\/2536354.2536355","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2013,6]]}}}