research-article

Open access

The Five-Minute Rule 20 Years Later: and How Flash Memory Changes the Rules: The old rule continues to evolve, while flash memory adds two new rules.

Author:

Goetz GraefeAuthors Info & Claims

Queue, Volume 6, Issue 4

Pages 40 - 52

https://doi.org/10.1145/1413254.1413264

Published: 01 July 2008 Publication History

All formats PDF

Abstract

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.

References

[1]

Gray, J., Putzolu, G.R. 1987. The 5-minute rule for trading memory for disk accesses and the 10-byte rule for trading memory for CPU time. SIGMOD Record 16(3): 395-398.

Digital Library

[2]

Gray, J., Graefe, G. 1997. The five-minute rule ten years later, and other computer storage rules of thumb. SIGMOD Record 26(4): 63-68.

Digital Library

[3]

Larus, J.R., Rajwar, R. 2007. Transactional Memory. Synthesis Lectures on Computer Architecture. Morgan and Claypool.

Digital Library

[4]

Hamilton, J. 2007. An architecture for modular data centers. CIDR (Conference on Innovative Data Systems Research).

[5]

Gray, J., Fitzgerald, B. Flash Disk Opportunity for Server-Applications; http://research.microsoft.com/~gray/papers/FlashDiskPublic.doc.

[6]

Härder, T., Reuter, A. 1983. Principles of transactionoriented database recovery. ACM Computing Surveys 15(4): 287-317.

Digital Library

[7]

Chen, P.M., Lee, E.L., Gibson, G.A., Katz, R.H., Patterson, D.A. 1994. RAID: High-performance, reliable secondary storage. ACM Computing Surveys 26(2): 145-185.

Digital Library

[8]

See reference 7.

[9]

Ousterhout, J.K., Douglis, F. 1989. Beating the I/O bottleneck: A case for log-structured file systems. Operating Systems Review 23(1): 11-28.

Digital Library

[10]

Woodhouse, D. 2001. JFFS: the Journaling Flash File System. Ottawa Linux Symposium. Red Hat Inc.

[11]

See reference 1.

[12]

See reference 1.

[13]

See reference 2.

[14]

See reference 1.

[15]

See reference 5.

[16]

See reference 1.

[17]

See reference 2.

[18]

Graefe, G. 2007. Master-detail clustering using merged indexes. Informatik ¿ Forschung und Entwicklung 21 (3-4): 127-145.

[19]

Carey, M.J., DeWitt, D.J., Richardson, J.E., Shekita, E.J. 1989. Storage management in EXODUS. Object-Oriented Concepts, Databases, and Applications: 341-369.

Digital Library

[20]

Stonebraker, M. 1981. Operating system support for database management. Communications of the ACM 24(7): 412-418 .

Digital Library

[21]

Graefe, G. 2004. Write-optimized B-trees. VLDB: 672-683.

Digital Library

[22]

See reference 21.

[23]

See reference 2.

[24]

Bayer, R., McCreight, E.M. 1970. Organization and maintenance of large ordered indexes. SIGFIDET Workshop: 107-141.

Digital Library

[25]

Bayer, R., Unterauer, K. 1977. Prefix B-trees. ACM Transactions on Database Systems 2(1): 11-26.

Digital Library

[26]

O'Neil, P.E. 1992. The SB-Tree: An index-sequential structure for high-performance sequential access. Acta Informatica 29(3): 241-265.

Digital Library

[27]

Lomet, D.B. 2001. The evolution of effective Btree page organization and techniques: A personal account. SIGMOD Record 30(3): 64-69.

Digital Library

[28]

Bender, M.A., Demaine, E.D., Farach-Colton, M. 2005. Cache-oblivious B-trees. SIAM Journal on Computing 35(2): 341-358.

Digital Library

[29]

Graefe, G. 2006. Implementing sorting in database systems. ACM Computing Surveys 38(3).

Digital Library

[30]

Nyberg, C., Barclay, T., Cvetanovic, Z., Gray, J., Lomet, D.B. 1995. AlphaSort: A cache-sensitive parallel external sort. VLDB Journal 4(4): 603-627.

Digital Library

[31]

Rivoire, S., Shah, M. Ranganathan, P., Kozyrakis, C. 2007. JouleSort: A balanced energy-efficiency benchmark. SIGMOD.

Digital Library

[32]

Shatdal, A., Kant, C., Naughton, J.F. 1994. Cacheconscious algorithms for relational query processing. VLDB: 510-521.

Digital Library

[33]

DeWitt, D.J., Naughton, J.F., Burger, J. 1993. Nested loops revisited. PDIS: 230-242.

Digital Library

[34]

Graefe, G. 2003. Executing nested queries. BTW: 58-77.

[35]

See reference 24.

[36]

See reference 18.

[37]

Härder, T. 1978. Implementing a generalized access path structure for a relational database system. ACM Transactions on Database Systems 3(3): 285-298.

Digital Library

Cited By

(2022)BibliographyStorage Systems10.1016/B978-0-32-390796-5.00023-1(641-693)Online publication date: 2022
https://doi.org/10.1016/B978-0-32-390796-5.00023-1
Thomasian A(2022)IntroductionStorage Systems10.1016/B978-0-32-390796-5.00010-3(1-87)Online publication date: 2022
https://doi.org/10.1016/B978-0-32-390796-5.00010-3
Kester MAthanassoulis MIdreos SChirkova RYang JSuciu D(2017)Access Path Selection in Main-Memory Optimized Data SystemsProceedings of the 2017 ACM International Conference on Management of Data10.1145/3035918.3064049(715-730)Online publication date: 9-May-2017
https://dl.acm.org/doi/10.1145/3035918.3064049
Show More Cited By

Index Terms

The Five-Minute Rule 20 Years Later: and How Flash Memory Changes the Rules: The old rule continues to evolve, while flash memory adds two new rules.

Recommendations

The five-minute rule 20 years later (and how flash memory changes the rules)
Barbara Liskov: ACM's A.M. Turing Award Winner

Revisiting Gray and Putzolu's famous rule in the age of Flash.
The five-minute rule twenty years later, and how flash memory changes the rules
DaMoN '07: Proceedings of the 3rd international workshop on Data management on new hardware

In 1987, Gray and Putzolo presented the five-minute rule, which was reviewed and renewed ten years later in 1997. With the advent of flash memory in the gap between traditional RAM main memory and traditional disk systems, the five-minute rule now ...
The five-minute rule ten years later, and other computer storage rules of thumb

Simple economic and performance arguments suggest appropriate lifetimes for main memory pages and suggest optimal page sizes. The fundamental tradeoffs are the prices and bandwidths of RAMs and disks. The analysis indicates that with today's technology, ...

Comments

Information & Contributors

Information

Published In

cover image Queue

Queue Volume 6, Issue 4

Enterprise Flash Storage

July/August 2008

51 pages

ISSN:1542-7730

EISSN:1542-7749

DOI:10.1145/1413254

Issue’s Table of Contents

Copyright © 2008 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 July 2008

Published in QUEUE Volume 6, Issue 4

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Research-article
Popular
Refereed

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

23
Total Citations
View Citations
50,364
Total Downloads

Downloads (Last 12 months)2,822
Downloads (Last 6 weeks)273

Reflects downloads up to 13 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

(2022)BibliographyStorage Systems10.1016/B978-0-32-390796-5.00023-1(641-693)Online publication date: 2022
https://doi.org/10.1016/B978-0-32-390796-5.00023-1
Thomasian A(2022)IntroductionStorage Systems10.1016/B978-0-32-390796-5.00010-3(1-87)Online publication date: 2022
https://doi.org/10.1016/B978-0-32-390796-5.00010-3
Kester MAthanassoulis MIdreos SChirkova RYang JSuciu D(2017)Access Path Selection in Main-Memory Optimized Data SystemsProceedings of the 2017 ACM International Conference on Management of Data10.1145/3035918.3064049(715-730)Online publication date: 9-May-2017
https://dl.acm.org/doi/10.1145/3035918.3064049
Zertal S(2014)Exploiting the Fine Grain SSD Internal Parallelism for OLTP and Scientific WorkloadsProceedings of the 2014 IEEE Intl Conf on High Performance Computing and Communications, 2014 IEEE 6th Intl Symp on Cyberspace Safety and Security, 2014 IEEE 11th Intl Conf on Embedded Software and Syst (HPCC,CSS,ICESS)10.1109/HPCC.2014.163(990-997)Online publication date: 20-Aug-2014
https://dl.acm.org/doi/10.1109/HPCC.2014.163
Schürmann FDelalondre FKumbhar PBiddiscombe JGila MTacchella DCurioni AMetzler BMorjan PFenkes JFranceschini MGermain RSchneidenbach LWard TFitch B(2014)Rebasing I/O for Scientific ComputingProceedings of the 29th International Conference on Supercomputing - Volume 848810.1007/978-3-319-07518-1_21(331-347)Online publication date: 22-Jun-2014
https://dl.acm.org/doi/10.1007/978-3-319-07518-1_21
Liu XSalem K(2013)Hybrid storage management for database systemsProceedings of the VLDB Endowment10.14778/2536354.25363556:8(541-552)Online publication date: 1-Jun-2013
https://dl.acm.org/doi/10.14778/2536354.2536355
Roh HPark SKim SShin MLee S(2011)B+-tree index optimization by exploiting internal parallelism of flash-based solid state drivesProceedings of the VLDB Endowment10.14778/2095686.20956885:4(286-297)Online publication date: 1-Dec-2011
https://dl.acm.org/doi/10.14778/2095686.2095688
Pavlo AJones EZdonik S(2011)On predictive modeling for optimizing transaction execution in parallel OLTP systemsProceedings of the VLDB Endowment10.14778/2078324.20783255:2(85-96)Online publication date: 1-Oct-2011
https://dl.acm.org/doi/10.14778/2078324.2078325
Yang DChen YLee WChen M(2011)On social-temporal group query with acquaintance constraintProceedings of the VLDB Endowment10.14778/1978665.19786714:6(397-408)Online publication date: 1-Mar-2011
https://dl.acm.org/doi/10.14778/1978665.1978671
Jahani ECafarella MRé C(2011)Automatic optimization for MapReduce programsProceedings of the VLDB Endowment10.14778/1978665.19786704:6(385-396)Online publication date: 1-Mar-2011
https://dl.acm.org/doi/10.14778/1978665.1978670
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Digital Edition

View this article in digital edition.

Digital Edition

Magazine Site

View this article on the magazine site (external)

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

Media

Figures

Other

Tables

View Issue’s Table of Contents