{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T04:20:15Z","timestamp":1743049215145,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642202438"},{"type":"electronic","value":"9783642202445"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-20244-5_24","type":"book-chapter","created":{"date-parts":[[2011,4,12]],"date-time":"2011-04-12T04:14:17Z","timestamp":1302581657000},"page":"241-253","source":"Crossref","is-referenced-by-count":5,"title":["Trading Memory for Performance and Energy"],"prefix":"10.1007","author":[{"given":"Yi","family":"Ou","sequence":"first","affiliation":[]},{"given":"Theo","family":"H\u00e4rder","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"24_CR1","unstructured":"Spiegel. Google-chef will noch mehr daten (2010), \n                      \n                        http:\/\/www.spiegel.de\/netzwelt\/netzpolitik\/0,1518,716204,00.html"},{"key":"24_CR2","first-page":"45","volume":"13","author":"T. H\u00e4rder","year":"2005","unstructured":"H\u00e4rder, T.: DBMS architecture - the layer model and its evolution. Datenbank-Spektrum\u00a013, 45\u201357 (2005)","journal-title":"Datenbank-Spektrum"},{"issue":"6","key":"24_CR3","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1109\/TPDS.2004.13","volume":"15","author":"Y. Zhou","year":"2004","unstructured":"Zhou, Y., Chen, Z., et al.: Second-level buffer cache management. IEEE Transactions on Parallel and Distributed Systems\u00a015(6), 505\u2013519 (2004)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"24_CR4","unstructured":"Koltsidas, I., Viglas, S.D.: The case for flash-aware multi-level caching. Technical Report (2009)"},{"key":"24_CR5","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1145\/1519065.1519081","volume-title":"EuroSys","author":"D. Narayanan","year":"2009","unstructured":"Narayanan, D., Thereska, E., et al.: Migrating server storage to SSDs: analysis of tradeoffs. In: EuroSys, pp. 145\u2013158. ACM, New York (2009)"},{"key":"24_CR6","volume-title":"Transaction Processing: Concepts and Techniques","author":"J. Gray","year":"1993","unstructured":"Gray, J., Reuter, A.: Transaction Processing: Concepts and Techniques. Morgan Kaufmann, San Francisco (1993)"},{"issue":"2","key":"24_CR7","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1145\/1089733.1089735","volume":"37","author":"E. Gal","year":"2005","unstructured":"Gal, E., Toledo, S.: Algorithms and data structures for flash memories. ACM Computing Surveys (CSUR)\u00a037(2), 138\u2013163 (2005)","journal-title":"ACM Computing Surveys (CSUR)"},{"key":"24_CR8","doi-asserted-by":"crossref","unstructured":"O\u2019Neil, E.J., O\u2019Neil, P.E., et al.: The LRU-K page replacement algorithm for database disk buffering. In: SIGMOD, pp. 297\u2013306 (1993)","DOI":"10.1145\/170036.170081"},{"key":"24_CR9","unstructured":"Johnson, T., Shasha, D., et al.: 2Q: a low overhead high performance buffer management replacement algorithm. In: VLDB, pp. 439\u2013450 (1994)"},{"key":"24_CR10","unstructured":"Megiddo, N., Modha, D.S.: ARC: A self-tuning, low overhead replacement cache. In: FAST. USENIX (2003)"},{"key":"24_CR11","doi-asserted-by":"publisher","first-page":"1351","DOI":"10.1109\/TCE.2009.5277999","volume":"55","author":"Z. Li","year":"2009","unstructured":"Li, Z., Jin, P., et al.: CCF-LRU: A new buffer replacement algorithm for flash memory. Trans. on Cons. Electr.\u00a055, 1351\u20131359 (2009)","journal-title":"Trans. on Cons. Electr."},{"key":"24_CR12","doi-asserted-by":"crossref","unstructured":"Ou, Y., H\u00e4rder, T.: Clean first or dirty first? a cost-aware self-adaptive buffer replacement policy. In: IDEAS, Montreal, QC, Canada (2010)","DOI":"10.1145\/1866480.1866482"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Adanced Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20244-5_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T21:06:14Z","timestamp":1558559174000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20244-5_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642202438","9783642202445"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20244-5_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}