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

Communications of the ACM

Volumn 52, Issue 7, 2009, Pages 48-59

  Graefe, Goetz ^a  

^a MICROSOFT   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FLASH MEMORY;

EID: 67650067132     PISSN: 00010782     EISSN: 15577317     Source Type: Journal    
DOI: 10.1145/1538788.1538805     Document Type: Article

References (27)

1. Ailamaki, A., DeWitt, D.J. and Hill, M.D. Data page layouts for relational databases on deep memory hierarchies. VLDB Journal 11, 3 (2002), 198-215.
2. Bender, M.A. Demaine, E.D. and Farach-Colton, M. Cache-oblivious B-trees. SIAM Journal on Computing 35, 2 (2005), 341-358.
3. Bayer, R. and McCreight, E.M. Organization and maintenance of large ordered indexes. SIGFI-DET Workshop (1970), 107-141.
4. Bayer, R. and Unterauer, K. Prefix B-trees. ACM Transactions on Database Systems 2, 1 (1977), 11-26.
5. Carey, M.J., DeWitt, D.J., Richardson, J.E. and Shekita, E.J. Storage management in EXODUS. In Object-Oriented Concepts, Databases, and Applications. W. Kim and F. Lochovsky, Eds. ACM, N.Y., 1989, 341-369.
6. Chen, P.M., Lee, E.L. Gibson, G.A, Katz, R.H. and Patterson, D.A. 1994. RAID: high-performance, reliable secondary storage. ACM Computing Surveys 26(2): 145-185.
7. DeWitt, D.J., Naughton, J.F. and Burger, J. Nested loops revisited. Parallel and Distributed Information Systems (1993), 230-242.
8. Graefe, G. Query evaluation techniques for large databases. ACM Computing Surveys 25,2 (1993), 73-170.
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. Graefe, G. Implementing sorting in database systems. ACM Computing Surveys 38, 3 (2006), 69-106.
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. Gray, J., Graefe, G. 1997. The five-minute rule ten years later, and other computer storage rules of thumb. SIGMOD Record 26, 4 (1997), 63-68.
15. Gray, J. and Putzolu, G.R. The 5-minute rule for trading memory for disk accesses and the 10-byte rule for trading memory for CPU time. SIGMOD Journal (1987), 395-398.
16. Hòrder, T. Implementing a generalized access path structure for a relational database system. ACM Transactions on Database Systems 3, 3 (1978), 285-298.
17. Hamilton, J. An architecture for modular data centers. In Proceedings of the Conference on Innovative Data Systems Research, 2007.
18. Hòrder, T. and Reuter, A. Principles of transaction-oriented database recovery. ACM Computing Surveys 15, 4 (1983), 287-317.
19. Lomet, D.B. The evolution of effective B-tree page organization and techniques: a personal account. SIGMOD Record 30, 3, 64-69.
20. Larus, J.R. and Rajwar, R. Transactional Memory. Synthesis Lectures on Computer Architecture. Morgan & Claypool, 2007.
21. Nyberg, C., Barclay, T., Cvetanovic, Z., Gray, J. and Lomet, D.B. AlphaSort: A cache-sensitive parallel external sort. VLDB Journal (1995), 603-627.
22. Ousterhout, J.K. and Douglis, F. Beating the I/O bottleneck: A case for log-structured file systems. Operating Systems Review 23, 1 (1989), 11-28.
23. 0'Neil, P.W. The SB-tree: An index-sequential structure for high-performance sequential access. Acta Informatica 29, 3 (1992), 241-265.
24. Rivoire, S., Shah, M., Ranganathan, P. and Kozyrakis, C. JouleSort: A balanced energy-efficiency benchmark. SIGMOD Record, 2007.
25. Stonebraker, M. Operating system support for database management. Commun. ACM 24, 7 (July 1981), 412-418.
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.