{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T07:55:50Z","timestamp":1758268550523,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319181196"},{"type":"electronic","value":"9783319181202"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-18120-2_11","type":"book-chapter","created":{"date-parts":[[2015,4,8]],"date-time":"2015-04-08T08:08:06Z","timestamp":1428480486000},"page":"175-190","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["A Cost-aware Buffer Management Policy for Flash-based Storage Devices"],"prefix":"10.1007","author":[{"given":"Zhiwen","family":"Jiang","sequence":"first","affiliation":[]},{"given":"Yong","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Jin","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Chunxiao","family":"Xing","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,4,9]]},"reference":[{"issue":"9","key":"11_CR1","doi-asserted-by":"publisher","first-page":"1116","DOI":"10.1145\/48529.48535","volume":"31","author":"A Aggarwal","year":"1988","unstructured":"Aggarwal, A., Vitter, J.S.: The input\/output complexity of sorting and related problems. Comm. of ACM 31(9), 1116\u20131127 (1988)","journal-title":"Comm. of ACM"},{"key":"11_CR2","unstructured":"Bouganim, L., Jonsson, B., Bonnet, P.: uflip: Understanding flash io patterns. In: CIDR (2009)"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Debnath, B.K., Sengupta, S., Li, J.: Skimpy stash: ram space skimpy key-value store on flash-based storage. In: SIGMOD, pp. 25\u201336 (2011)","DOI":"10.1145\/1989323.1989327"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Do, J., Zhang, D., et al. J.M.P.: Turbocharging dbms buffer pool using ssds. In: SIGMOD, pp. 1113\u20131124 (2011)","DOI":"10.1145\/1989323.1989442"},{"issue":"4","key":"11_CR5","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1145\/1994.2022","volume":"9","author":"W Effelsberg","year":"1984","unstructured":"Effelsberg, W., Harder, T.: Principles of database buffer management. TODS 9(4), 560\u2013595 (1984)","journal-title":"TODS"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Gal, E., Toledo, S.: Algorithms and data structures for flash memories. ACM Computing Survey (2005)","DOI":"10.1145\/1089733.1089735"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Jiang, S., Zhang, X.: Lirs: an efficient low inter-reference recency set replacement policy to improve buffer cache performance. In: SIGMETRICS, pp. 31\u201342 (2002)","DOI":"10.1145\/511399.511340"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Jiang, Z., Zhang, Y., Wang, J., Xing, C.: A cost-aware buffer management policy for flash-based storage devices. Technical Report (2015)","DOI":"10.1007\/978-3-319-18120-2_11"},{"key":"11_CR9","unstructured":"Johnson, T., Shasha, D.: 2q: A low overhead high performance buffer management replacement algorithm. In: PVLDB, pp. 439\u2013450 (1994)"},{"key":"11_CR10","unstructured":"Kim, H., Ahn, S.: Bplru: A buffer management scheme for improving random writes in flash storage. In: FAST (2008)"},{"issue":"12","key":"11_CR11","doi-asserted-by":"publisher","first-page":"1352","DOI":"10.1109\/TC.2001.970573","volume":"50","author":"D Lee","year":"2001","unstructured":"Lee, D., Choi, J., Kim, J.H., et al.: Lrfu: A spectrum of policies that subsumes the least recently used and least frequently used policies. IEEE Trans. on Computers 50(12), 1352\u20131361 (2001)","journal-title":"IEEE Trans. on Computers"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"Lee, S.W., Moon, B.: Design of flash-based dbms: an in-page logging approach. In: SIGMOD, pp. 55\u201366 (2007)","DOI":"10.1145\/1247480.1247488"},{"issue":"1","key":"11_CR13","first-page":"1195","volume":"3","author":"Y Li","year":"2010","unstructured":"Li, Y., He, B., Yang, R.J., Luo, Q., Yi, K.: Tree indexing on solid state drives. PVLDB 3(1), 1195\u20131206 (2010)","journal-title":"PVLDB"},{"issue":"7","key":"11_CR14","doi-asserted-by":"publisher","first-page":"1417","DOI":"10.1109\/TC.2012.86","volume":"62","author":"Y Li","year":"2012","unstructured":"Li, Y., On, S.T., Xu, J., Choi, B., Hu, H.: Optimizing non-indexed join processing in flash storage-based systems. IEEE Trans. on Computers 62(7), 1417\u20131431 (2012)","journal-title":"IEEE Trans. on Computers"},{"issue":"8","key":"11_CR15","doi-asserted-by":"publisher","first-page":"541","DOI":"10.14778\/2536354.2536355","volume":"6","author":"X Liu","year":"2013","unstructured":"Liu, X., Salem, K.: Hybrid storage management for database systems. Proceedings of the VLDB Endowment 6(8), 541\u2013552 (2013)","journal-title":"Proceedings of the VLDB Endowment"},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"Lv, Y., Cui, B., He, B., Chen, X.: Operation-aware buffer management in flash-based systems. In: SIGMOD, pp. 13\u201324 (2011)","DOI":"10.1145\/1989323.1989326"},{"key":"11_CR17","doi-asserted-by":"crossref","unstructured":"On, S.T., Gao, S., He, B., Wu, M., Luo, Q., Xu, J.: Fd-buffer: A cost-based adaptive buffer replacement algorithm for flash memory devices. IEEE Trans. on Computers (2013)","DOI":"10.1109\/TC.2013.52"},{"key":"11_CR18","doi-asserted-by":"crossref","unstructured":"O\u2019Neil, E.J., O\u2019Neil, P.E., Weikum, G.: The lru-k page replacement algorithm for database disk buffering. In: SIGMOD, pp. 297\u2013306 (1993)","DOI":"10.1145\/170036.170081"},{"key":"11_CR19","doi-asserted-by":"crossref","unstructured":"Ou, Y., Harder, T.: Clean first or dirty first? a cost-aware self-adaptive buffer replacement policy. In: IDEAS (2010)","DOI":"10.1145\/1866480.1866482"},{"key":"11_CR20","doi-asserted-by":"crossref","unstructured":"Ou, Y., Harder, T., Jin, P.: Cfdc: A flash-aware replacement policy for database buffer management. In: DaMoN (2009)","DOI":"10.1145\/1565694.1565698"},{"key":"11_CR21","doi-asserted-by":"crossref","unstructured":"Park, S.Y., Jung, D., Kang, J.U., Kim, J.S., Lee, J.: Cflru: a replacement algorithm for flash memory. In: CASES, pp. 234\u2013241 (2006)","DOI":"10.1145\/1176760.1176789"},{"key":"11_CR22","doi-asserted-by":"crossref","unstructured":"Tsirogiannis, D., Harizopoulos, S., Shah, M.A., Wiener, J.L., Graefe, G.: Query processing techniques for solid state drives. In: SIGMOD, pp. 59\u201372 (2009)","DOI":"10.1145\/1559845.1559854"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-18120-2_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T00:08:05Z","timestamp":1676938085000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-18120-2_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319181196","9783319181202"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-18120-2_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"9 April 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}