The five-minute rule ten years later, and other computer storage rules of thumb

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

The five-minute rule ten years later, and other computer storage rules of thumb

Full text

Pdf (670 KB)

Source

ACM SIGMOD Record archive
Volume 26 , Issue 4 (December 1997) table of contents

Pages: 63 - 68

Year of Publication: 1997

ISSN:0163-5808

Authors

Jim Gray	Microsoft Research, San Francisco, CA
Goetz Graefe	Microsoft Research, San Francisco, CA

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 30, Downloads (12 Months): 160, Citation Count: 31

Additional Information:

abstract cited by index terms collaborative colleagues

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/271074.271094 What is a DOI?

ABSTRACT

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, five minutes is a good lifetime for randomly accessed pages, one minute is a good lifetime for two-pass sequentially accessed pages, and 16 KB is a good size for index pages. These rules-of-thumb change in predictable ways as technology ratios change. They also motivate the importance of the new Kaps, Maps, Scans, and $/Kaps, $/Maps, $/TBscan metrics.

CITED BY 31

	Kihong Kim , Sang K. Cha, Sibling clustering of tree-based spatial indexes for efficient spatial query processing, Proceedings of the seventh international conference on Information and knowledge management, p.398-405, November 02-07, 1998, Bethesda, Maryland, United States
	Vijayshankar Raman, Locality preserving dictionaries: theory & application to clustering in databases, Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, p.337-345, May 31-June 03, 1999, Philadelphia, Pennsylvania, United States
	Anthony K. H. Tung , Y. C. Tay , Hongjun Lu, BROOM: buffer replacement using online optimization by mining, Proceedings of the seventh international conference on Information and knowledge management, p.185-192, November 02-07, 1998, Bethesda, Maryland, United States
	Michael A. Bender , Ziyang Duan , John Iacono , Jing Wu, A locality-preserving cache-oblivious dynamic dictionary, Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms, p.29-38, January 06-08, 2002, San Francisco, California
	Kurt W. Deschler , Elke A. Rundensteiner, B+ retake: sustaining high volume inserts into large data pages, Proceedings of the 4th ACM international workshop on Data warehousing and OLAP, p.56-63, November 09-09, 2001, Atlanta, Georgia, USA
	Jose Renato Santos , Richard R. Muntz , Berthier Ribeiro-Neto, Comparing random data allocation and data striping in multimedia servers, ACM SIGMETRICS Performance Evaluation Review, v.28 n.1, p.44-55, June 2000
	Koen Holtman , Peter van der Stok , Ian Willers, A cache filtering optimisation for queries to massive datasets on tertiary storage, Proceedings of the 2nd ACM international workshop on Data warehousing and OLAP, p.94-100, November 02-06, 1999, Kansas City, Missouri, United States
	Richard A. Hankins , Jignesh M. Patel, Effect of node size on the performance of cache-conscious B⁺-trees, ACM SIGMETRICS Performance Evaluation Review, v.31 n.1, June 2003
	Alexander Thomasian , Chang Liu, Disk scheduling policies with lookahead, ACM SIGMETRICS Performance Evaluation Review, v.30 n.2, September 2002
	Peter J. Haas , Joseph M. Hellerstein, Ripple joins for online aggregation, ACM SIGMOD Record, v.28 n.2, p.287-298, June 1999
	David Lomet, The evolution of effective B-tree: page organization and techniques: a personal account, ACM SIGMOD Record, v.30 n.3, September 2001
	Michael A. Bender , Ziyang Duan , John Iacono , Jing Wu, A locality-preserving cache-oblivious dynamic dictionary, Journal of Algorithms, v.53 n.2, p.115-136, November 2004
	Damianos Chatziantoniou , Theodore Johnson, Decision support queries on a tape-resident data warehouse, Information Systems, v.30 n.2, p.133-149, April 2005
	Shimin Chen , Phillip B. Gibbons , Todd C. Mowry , Gary Valentin, Fractal prefetching B⁺-Trees: optimizing both cache and disk performance, Proceedings of the 2002 ACM SIGMOD international conference on Management of data, June 03-06, 2002, Madison, Wisconsin
	Goetz Graefe, B-tree indexes, interpolation search, and skew, Proceedings of the 2nd international workshop on Data management on new hardware, June 25-25, 2006, Chicago, Illinois
	Goetz Graefe, The five-minute rule 20 years later (and how flash memory changes the rules), Communications of the ACM, v.52 n.7, July 2009
	Gerhard Weikum , Axel Moenkeberg , Christof Hasse , Peter Zabback, Self-tuning database technology and information services: from wishful thinking to viable engineering, Proceedings of the 28th international conference on Very Large Data Bases, p.20-31, August 20-23, 2002, Hong Kong, China
	Ravishankar Ramamurthy , David J. DeWitt , Qi Su, A case for fractured mirrors, Proceedings of the 28th international conference on Very Large Data Bases, p.430-441, August 20-23, 2002, Hong Kong, China
	André Seifert , Marc H. Scholl, A multi-version cache replacement and prefetching policy for hybrid data delivery environments, Proceedings of the 28th international conference on Very Large Data Bases, p.850-861, August 20-23, 2002, Hong Kong, China
	Suman Nath , Aman Kansal, FlashDB: dynamic self-tuning database for NAND flash, Proceedings of the 6th international conference on Information processing in sensor networks, April 25-27, 2007, Cambridge, Massachusetts, USA
	Seon Ho Kim , Hong Zhu , Roger Zimmermann, Zoned-RAID, ACM Transactions on Storage (TOS), v.3 n.1, p.1-es, March 2007
	Theodore Johnson , Ethan L. Miller, Performance Measurements of Tertiary Storage Devices, Proceedings of the 24rd International Conference on Very Large Data Bases, p.50-61, August 24-27, 1998
	Harald Schöning, The ADABAS Buffer Pool Manager, Proceedings of the 24rd International Conference on Very Large Data Bases, p.675-679, August 24-27, 1998
	Yasushi Sakurai , Masatoshi Yoshikawa , Ryoji Kataoka , Shunsuke Uemura, Similarity Search for Adaptive Ellipsoid Queries Using Spatial Transformation, Proceedings of the 27th International Conference on Very Large Data Bases, p.231-240, September 11-14, 2001
	Ravishankar Ramamurthy , David J. DeWitt , Qi Su, A case for fractured mirrors, The VLDB Journal — The International Journal on Very Large Data Bases, v.12 n.2, p.89-101, August 2003
	Joseph M. Hellerstein , Ron Avnur , Vijayshankar Raman, Informix under CONTROL: Online Query Processing, Data Mining and Knowledge Discovery, v.4 n.4, p.281-314, October 2000
	Weifeng Shi , Shahram Ghandeharizadeh, Controlled Buffer Sharing in Continuous Media Servers, Multimedia Tools and Applications, v.23 n.2, p.131-159, June 2004
	Goetz Graefe, The Five-minute Rule 20 Years Later: and How Flash Memory Changes the Rules, Queue, v.6 n.4, July/August 2008
	Goetz Graefe, The five-minute rule twenty years later, and how flash memory changes the rules, Proceedings of the 3rd international workshop on Data management on new hardware, June 15-15, 2007, Beijing, China
	Dongwon Kang , Dawoon Jung , Jeong-Uk Kang , Jin-Soo Kim, μ-tree: an ordered index structure for NAND flash memory, Proceedings of the 7th ACM & IEEE international conference on Embedded software, September 30-October 03, 2007, Salzburg, Austria
	Nikolas Askitis , Justin Zobel, B-tries for disk-based string management, The VLDB Journal — The International Journal on Very Large Data Bases, v.18 n.1, p.157-179, January 2009