{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T09:01:50Z","timestamp":1775638910443,"version":"3.50.1"},"reference-count":37,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2008,7,1]],"date-time":"2008-07-01T00:00:00Z","timestamp":1214870400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Queue"],"published-print":{"date-parts":[[2008,7]]},"abstract":"<jats:p>In 1987, Jim Gray and Gianfranco Putzolu published their now-famous five-minute rule for trading off memory and I\/O capacity. Their calculation compares the cost of holding a record (or page) permanently in memory with the cost of performing disk I\/O each time the record (or page) is accessed, using appropriate fractions of prices for RAM chips and disk drives. The name of their rule refers to the break-even interval between accesses. If a record (or page) is accessed more often, it should be kept in memory; otherwise, it should remain on disk and read when needed.<\/jats:p>","DOI":"10.1145\/1413254.1413264","type":"journal-article","created":{"date-parts":[[2008,9,30]],"date-time":"2008-09-30T13:03:15Z","timestamp":1222779795000},"page":"40-52","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["The Five-Minute Rule 20 Years Later: and How Flash Memory Changes the Rules"],"prefix":"10.1145","volume":"6","author":[{"given":"Goetz","family":"Graefe","sequence":"first","affiliation":[{"name":"Hewlett-Packard Laboratories"}]}],"member":"320","published-online":{"date-parts":[[2008,7]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/38714.38755"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/271074.271094"},{"key":"e_1_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Larus J.R. Rajwar R. 2007. Transactional Memory. Synthesis Lectures on Computer Architecture. Morgan and Claypool.   Larus J.R. Rajwar R. 2007. Transactional Memory. Synthesis Lectures on Computer Architecture. Morgan and Claypool.","DOI":"10.1007\/978-3-031-01719-3"},{"key":"e_1_2_1_4_1","unstructured":"Hamilton J. 2007. An architecture for modular data centers. CIDR (Conference on Innovative Data Systems Research).  Hamilton J. 2007. An architecture for modular data centers. CIDR (Conference on Innovative Data Systems Research)."},{"key":"e_1_2_1_5_1","unstructured":"Gray J. Fitzgerald B. Flash Disk Opportunity for Server-Applications; http:\/\/research.microsoft.com\/~gray\/papers\/FlashDiskPublic.doc.  Gray J. Fitzgerald B. Flash Disk Opportunity for Server-Applications; http:\/\/research.microsoft.com\/~gray\/papers\/FlashDiskPublic.doc."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/289.291"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/176979.176981"},{"key":"e_1_2_1_8_1","unstructured":"See  reference 7.  See reference 7."},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/65762.65765"},{"key":"e_1_2_1_10_1","volume-title":"JFFS: the Journaling Flash File System. Ottawa Linux Symposium. Red Hat Inc.","author":"Woodhouse D.","year":"2001"},{"key":"e_1_2_1_11_1","unstructured":"See  reference 1.  See reference 1."},{"key":"e_1_2_1_12_1","unstructured":"See  reference 1.  See reference 1."},{"key":"e_1_2_1_13_1","unstructured":"See  reference 2.  See reference 2."},{"key":"e_1_2_1_14_1","unstructured":"See  reference 1.  See reference 1."},{"key":"e_1_2_1_15_1","unstructured":"See  reference 5.  See reference 5."},{"key":"e_1_2_1_16_1","unstructured":"See  reference 1.  See reference 1."},{"key":"e_1_2_1_17_1","unstructured":"See  reference 2.  See reference 2."},{"key":"e_1_2_1_18_1","doi-asserted-by":"crossref","unstructured":"Graefe G. 2007. Master-detail clustering using merged indexes. Informatik \u00bf Forschung und Entwicklung 21 (3-4): 127-145.  Graefe G. 2007. Master-detail clustering using merged indexes. Informatik \u00bf Forschung und Entwicklung 21 (3-4): 127-145.","DOI":"10.1007\/s00450-007-0022-4"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/63320.66509"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/358699.358703"},{"key":"e_1_2_1_21_1","first-page":"672","article-title":"Write-optimized B-trees","author":"Graefe G.","year":"2004","journal-title":"VLDB"},{"key":"e_1_2_1_22_1","unstructured":"See  reference 21.  See reference 21."},{"key":"e_1_2_1_23_1","unstructured":"See  reference 2.  See reference 2."},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1734663.1734671"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/320521.320530"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01185680"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/603867.603878"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539701389956"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132960.1132964"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/615232.615237"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1247480.1247522"},{"key":"e_1_2_1_32_1","first-page":"510","article-title":"Cacheconscious algorithms for relational query processing","author":"Shatdal A.","year":"1994","journal-title":"VLDB"},{"key":"e_1_2_1_33_1","first-page":"230","article-title":"Nested loops revisited","author":"DeWitt D.J.","year":"1993","journal-title":"PDIS"},{"key":"e_1_2_1_34_1","first-page":"58","article-title":"Executing nested queries","author":"Graefe G.","year":"2003","journal-title":"BTW"},{"key":"e_1_2_1_35_1","unstructured":"See  reference 24.  See reference 24."},{"key":"e_1_2_1_36_1","unstructured":"See  reference 18.  See reference 18."},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/320263.320284"}],"container-title":["Queue"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1413254.1413264","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1413254.1413264","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:30:12Z","timestamp":1750253412000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1413254.1413264"}},"subtitle":["The old rule continues to evolve, while flash memory adds two new rules."],"short-title":[],"issued":{"date-parts":[[2008,7]]},"references-count":37,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2008,7]]}},"alternative-id":["10.1145\/1413254.1413264"],"URL":"https:\/\/doi.org\/10.1145\/1413254.1413264","relation":{},"ISSN":["1542-7730","1542-7749"],"issn-type":[{"value":"1542-7730","type":"print"},{"value":"1542-7749","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,7]]},"assertion":[{"value":"2008-07-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}