The five-minute rule 20 years later (and how flash memory changes the rules)

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

The five-minute rule 20 years later (and how flash memory changes the rules)

Full text

Digital Edition , Html

Html (67 KB), Pdf

Pdf (4.89 MB)

Source

Communications of the ACM archive
Volume 52 , Issue 7 (July 2009) table of contents
Barbara Liskov: ACM's A.M. Turing Award Winner

SECTION: Practice table of contents

Pages 48-59

Year of Publication: 2009

ISSN:0001-0782

Author

Goetz Graefe

Microsoft

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 836, Downloads (12 Months): 18730, Citation Count: 0

Additional Information:

abstract references index terms collaborative colleagues

Tools and Actions:	Request Permissions 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/1538788.1538805 What is a DOI?

ABSTRACT

Revisiting Gray and Putzolu's famous rule in the age of Flash.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Anastassia Ailamaki , David J. DeWitt , Mark D. Hill, Data page layouts for relational databases on deep memory hierarchies, The VLDB Journal — The International Journal on Very Large Data Bases, v.11 n.3, p.198-215, November 2002 [doi>10.1007/s00778-002-0074-9]
	2	Michael A. Bender , Erik D. Demaine , Martin Farach-Colton, Cache-Oblivious B-Trees, SIAM Journal on Computing, v.35 n.2, p.341-358, 2005 [doi>10.1137/S0097539701389956]
	3	Bayer, R. and McCreight, E.M. Organization and maintenance of large ordered indexes. SIGFI-DET Workshop (1970), 107--141.
	4	Rudolf Bayer , Karl Unterauer, Prefix B-trees, ACM Transactions on Database Systems (TODS), v.2 n.1, p.11-26, March 1977 [doi>10.1145/320521.320530]
	5	Michael J. Carey , David J. DeWitt , Joel F. Richardson , Eugene J. Shekita, Storage management for objects in EXODUS, Object-oriented concepts, databases, and applications, ACM, New York, NY, 1989 [doi>10.1145/63320.66509]
	6	Peter M. Chen , Edward K. Lee , Garth A. Gibson , Randy H. Katz , David A. Patterson, RAID: high-performance, reliable secondary storage, ACM Computing Surveys (CSUR), v.26 n.2, p.145-185, June 1994 [doi>10.1145/176979.176981]
	7	David J. DeWitt , Jeffrey F. Naughton , Joseph Burger, Nested Loops Revisited, Proceedings of the 2nd International Conference on Parallel and Distributed Information Systems, p.230-242, January 20-23, 1993
	8	Goetz Graefe, Query evaluation techniques for large databases, ACM Computing Surveys (CSUR), v.25 n.2, p.73-169, June 1993 [doi>10.1145/152610.152611]
	9	Graefe, G. Executing nested queries. Database Systems for Business, Technology and Web (2003), 58--77.
	10	Graefe, G. Write-optimized B-trees. VLDB Journal (2004), 672--683.
	11	Goetz Graefe, Implementing sorting in database systems, ACM Computing Surveys (CSUR), v.38 n.3, p.10-es, 2006 [doi>10.1145/1132960.1132964]
	12	Graefe, G. Master-detail clustering using merged indexes. Informatik--Forschung und Fntwicklun, 2007.
	13	Gray, J. and Fitzgerald, B. 2007. Flash disk opportunity for server-applications; http://research.microsoft.com/~gray/papers/FlashDiskPublic.doc.
	14	Jim Gray , Goetz Graefe, The five-minute rule ten years later, and other computer storage rules of thumb, ACM SIGMOD Record, v.26 n.4, p.63-68, Dec. 1997 [doi>10.1145/271074.271094]
	15	Jim Gray , Franco Putzolu, The 5 minute rule for trading memory for disc accesses and the 10 byte rule for trading memory for CPU time, ACM SIGMOD Record, v.16 n.3, p.395-398, Dec. 1987
	16	Theo Haerder, Implementing a generalized access path structure for a relational database system, ACM Transactions on Database Systems (TODS), v.3 n.3, p.285-298, Sept. 1978 [doi>10.1145/320263.320284]
	17	Hamilton, J. An architecture for modular data centers. In Proceedings of the Conference on Innovative Data Systems Research, 2007.
	18	Theo Haerder , Andreas Reuter, Principles of transaction-oriented database recovery, ACM Computing Surveys (CSUR), v.15 n.4, p.287-317, December 1983 [doi>10.1145/289.291]
	19	David Lomet, The evolution of effective B-tree: page organization and techniques: a personal account, ACM SIGMOD Record, v.30 n.3, September 2001 [doi>10.1145/603867.603878]
	20	Jim Larus , Ravi Rajwar, Transactional Memory (Synthesis Lectures on Computer Architecture), Morgan & Claypool Publishers, 2007
	21	Chris Nyberg , Tom Barclay , Zarka Cvetanovic , Jim Gray , Dave Lomet, AlphaSort: a cache-sensitive parallel external sort, The VLDB Journal — The International Journal on Very Large Data Bases, v.4 n.4, October 1995
	22	John Ousterhout , Fred Douglis, Beating the I/O bottleneck: a case for log-structured file systems, ACM SIGOPS Operating Systems Review, v.23 n.1, p.11-28, Jan. 1989 [doi>10.1145/65762.65765]
	23	Patrick E. O'Neil, The SB-tree: an index-sequential structure for high-performance sequential access, Acta Informatica, v.29 n.3, p.241-265, June 1992 [doi>10.1007/BF01185680]
	24	Rivoire, S., Shah, M., Ranganathan, P. and Kozyrakis, C. JouleSort: A balanced energy-efficiency benchmark. SIGMOD Record, 2007.
	25	Michael Stonebraker, Operating system support for database management, Communications of the ACM, v.24 n.7, p.412-418, July 1981 [doi>10.1145/358699.358703]
	26	Shatdal, A., Kant, C. and Naughton, J.F. Cache-conscious algorithms for relational query processing. VLDB Journal (1994), 510--521.
	27	Woodhouse, D. JFFS: The Journaling Flash File System. Ottawa Linux Symposium, Red Hat Inc., 2001.