{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,24]],"date-time":"2026-06-24T07:51:49Z","timestamp":1782287509626,"version":"3.54.5"},"reference-count":20,"publisher":"Association for Computing Machinery (ACM)","issue":"11","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2012,7]]},"abstract":"<jats:p>\n            Considering the current price gap between disk and flash memory drives, for applications dealing with large scale data, it will be economically more sensible to use flash memory drives to supplement disk drives rather than to replace them. This paper presents\n            <jats:italic>FaCE<\/jats:italic>\n            , which is a new low-overhead caching strategy that uses flash memory as an extension to the DRAM buffer.\n            <jats:italic>FaCE<\/jats:italic>\n            aims at improving the transaction throughput as well as shortening the recovery time from a system failure. To achieve the goals, we propose two novel algorithms for flash cache management, namely,\n            <jats:italic>Multi-Version FIFO replacement<\/jats:italic>\n            and\n            <jats:italic>Group Second Chance<\/jats:italic>\n            . One striking result from\n            <jats:italic>FaCE<\/jats:italic>\n            is that using a small flash memory drive as a caching device could deliver even higher throughput than using a large flash memory drive to store the entire database tables. This was possible due to\n            <jats:italic>flash write optimization<\/jats:italic>\n            as well as\n            <jats:italic>disk access reduction<\/jats:italic>\n            obtained by the\n            <jats:italic>FaCE<\/jats:italic>\n            caching methods. In addition,\n            <jats:italic>FaCE<\/jats:italic>\n            takes advantage of the non-volatility of flash memory to fully support database recovery by extending the scope of a persistent database to include the data pages stored in the flash cache. We have implemented\n            <jats:italic>FaCE<\/jats:italic>\n            in the PostgreSQL open source database server and demonstrated its effectiveness for TPC-C benchmarks.\n          <\/jats:p>","DOI":"10.14778\/2350229.2350274","type":"journal-article","created":{"date-parts":[[2014,6,24]],"date-time":"2014-06-24T12:17:57Z","timestamp":1403612277000},"page":"1615-1626","source":"Crossref","is-referenced-by-count":33,"title":["Flash-based extended cache for higher throughput and faster recovery"],"prefix":"10.14778","volume":"5","author":[{"given":"Woon-Hak","family":"Kang","sequence":"first","affiliation":[{"name":"Sungkyunkwan University, Suwon, Korea"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sang-Won","family":"Lee","sequence":"additional","affiliation":[{"name":"Sungkyunkwan University, Suwon, Korea"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bongki","family":"Moon","sequence":"additional","affiliation":[{"name":"University of Arizona, Tucson, Arizona"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2012,7]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/363011.363155"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1995441.1995443"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687553.1687557"},{"issue":"2","key":"e_1_2_1_4_1","first-page":"1435","volume":"3","author":"Canim M.","year":"2010","unstructured":"M. Canim , G. A. Mihaila , B. Bhattacharjee , K. A. Ross , and C. A. Lang . SSD Bufferpool Extensions for Database Systems. PVLDB , 3 ( 2 ): 1435 -- 1446 , 2010 . M. Canim, G. A. Mihaila, B. Bhattacharjee, K. A. Ross, and C. A. Lang. SSD Bufferpool Extensions for Database Systems. PVLDB, 3(2):1435--1446, 2010.","journal-title":"SSD Bufferpool Extensions for Database Systems. PVLDB"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/2014698.2014864"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989442"},{"key":"e_1_2_1_7_1","unstructured":"DramExchange. Price Quites. http:\/\/www.dramexchange.com\/.  DramExchange. Price Quites. http:\/\/www.dramexchange.com\/."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1413254.1413261"},{"key":"e_1_2_1_9_1","volume-title":"Transaction Processing: Concepts and Technique","author":"Gray J.","year":"1993","unstructured":"J. Gray and A. Reuter . Transaction Processing: Concepts and Technique . Morgan Kaufman Publishers, Inc. , 1993 . J. Gray and A. Reuter. Transaction Processing: Concepts and Technique. Morgan Kaufman Publishers, Inc., 1993."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1516360.1516365"},{"issue":"1","key":"e_1_2_1_11_1","first-page":"514","volume":"1","author":"Koltsidas I.","year":"2008","unstructured":"I. Koltsidas and S. D. Viglas . Flashing Up the Storage Layer. PVLDB , 1 ( 1 ): 514 -- 525 , 2008 . I. Koltsidas and S. D. Viglas. Flashing Up the Storage Layer. PVLDB, 1(1):514--525, 2008.","journal-title":"Flashing Up the Storage Layer. PVLDB"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559937"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376723"},{"key":"e_1_2_1_14_1","unstructured":"D. Lussier and S. Martin. The BenchmarkSQL Project. http:\/\/benchmarksql.sourceforge.net.  D. Lussier and S. Martin. The BenchmarkSQL Project. http:\/\/benchmarksql.sourceforge.net."},{"key":"e_1_2_1_15_1","unstructured":"Oracle Corp. ORION: Oracle I\/O Test Tool. http:\/\/goo.gl\/OQO7U.  Oracle Corp. ORION: Oracle I\/O Test Tool. http:\/\/goo.gl\/OQO7U."},{"key":"e_1_2_1_16_1","volume-title":"Oracle Databasse Concepts 11g Rel. 2","author":"Oracle Corp.","year":"2010","unstructured":"Oracle Corp. Oracle Databasse Concepts 11g Rel. 2 . Feb 2010 . Oracle Corp. Oracle Databasse Concepts 11g Rel. 2. Feb 2010."},{"key":"e_1_2_1_17_1","volume-title":"December","author":"Oracle Corp.","year":"2010","unstructured":"Oracle Corp. Oracle TPC Benchmark C Full Disclosure Report , December 2010 . Oracle Corp. Oracle TPC Benchmark C Full Disclosure Report, December 2010."},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/253260.253279"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.1993.287729"},{"key":"e_1_2_1_20_1","first-page":"91","volume-title":"Proceedings of USENIX Annual Technical Conference","author":"Zhou Y.","year":"2001","unstructured":"Y. Zhou , J. F. Philbin , and K. Li . The Multi-Queue Replacement Algorithm for Second Level Buffer Caches . In Proceedings of USENIX Annual Technical Conference , pages 91 -- 104 , June 2001 . Y. Zhou, J. F. Philbin, and K. Li. The Multi-Queue Replacement Algorithm for Second Level Buffer Caches. In Proceedings of USENIX Annual Technical Conference, pages 91--104, June 2001."}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/2350229.2350274","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T11:30:59Z","timestamp":1672227059000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/2350229.2350274"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,7]]},"references-count":20,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2012,7]]}},"alternative-id":["10.14778\/2350229.2350274"],"URL":"https:\/\/doi.org\/10.14778\/2350229.2350274","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2012,7]]}}}