Goetz Graefe
- ]]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. Google Scholar
Digital Library
- ]]Bender, M.A. Demaine, E.D. and Farach-Colton, M. Cache-oblivious B-trees. SIAM Journal on Computing 35, 2 (2005), 341--358. Google ScholarDigital Library
- ]]Bayer, R. and McCreight, E.M. Organization and maintenance of large ordered indexes. SIGFI-DET Workshop (1970), 107--141.Google Scholar
- ]]Bayer, R. and Unterauer, K. Prefix B-trees. ACM Transactions on Database Systems 2, 1 (1977), 11--26. Google ScholarDigital Library
- ]]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. Google ScholarDigital Library
- ]]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. Google ScholarDigital Library
- ]]DeWitt, D.J., Naughton, J.F. and Burger, J. Nested loops revisited. Parallel and Distributed Information Systems (1993), 230--242. Google ScholarDigital Library
- ]]Graefe, G. Query evaluation techniques for large databases. ACM Computing Surveys 25,2 (1993), 73--170. Google ScholarDigital Library
- ]]Graefe, G. Executing nested queries. Database Systems for Business, Technology and Web (2003), 58--77.Google Scholar
- ]]Graefe, G. Write-optimized B-trees. VLDB Journal (2004), 672--683. Google ScholarDigital Library
- ]]Graefe, G. Implementing sorting in database systems. ACM Computing Surveys 38, 3 (2006), 69--106. Google ScholarDigital Library
- ]]Graefe, G. Master-detail clustering using merged indexes. Informatik--Forschung und Fntwicklun, 2007.Google ScholarCross Ref
- ]]Gray, J. and Fitzgerald, B. 2007. Flash disk opportunity for server-applications; http://research.microsoft.com/~gray/papers/FlashDiskPublic.doc.Google Scholar
- ]]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. Google ScholarDigital Library
- ]]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. Google ScholarDigital Library
- ]]Härder, T. Implementing a generalized access path structure for a relational database system. ACM Transactions on Database Systems 3, 3 (1978), 285--298. Google ScholarDigital Library
- ]]Hamilton, J. An architecture for modular data centers. In Proceedings of the Conference on Innovative Data Systems Research, 2007.Google Scholar
- ]]Härder, T. and Reuter, A. Principles of transaction-oriented database recovery. ACM Computing Surveys 15, 4 (1983), 287--317. Google ScholarDigital Library
- ]]Lomet, D.B. The evolution of effective B-tree page organization and techniques: a personal account. SIGMOD Record 30, 3, 64--69. Google ScholarDigital Library
- ]]Larus, J.R. and Rajwar, R. Transactional Memory. Synthesis Lectures on Computer Architecture. Morgan & Claypool, 2007. Google ScholarDigital Library
- ]]Nyberg, C., Barclay, T., Cvetanovic, Z., Gray, J. and Lomet, D.B. AlphaSort: A cache-sensitive parallel external sort. VLDB Journal (1995), 603--627. Google ScholarDigital Library
- ]]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. Google ScholarDigital Library
- ]]0'Neil, P.W. The SB-tree: An index-sequential structure for high-performance sequential access. Acta Informatica 29, 3 (1992), 241--265. Google ScholarDigital Library
- ]]Rivoire, S., Shah, M., Ranganathan, P. and Kozyrakis, C. JouleSort: A balanced energy-efficiency benchmark. SIGMOD Record, 2007. Google ScholarDigital Library
- ]]Stonebraker, M. Operating system support for database management. Commun. ACM 24, 7 (July 1981), 412--418. Google ScholarDigital Library
- ]]Shatdal, A., Kant, C. and Naughton, J.F. Cache-conscious algorithms for relational query processing. VLDB Journal (1994), 510--521. Google ScholarDigital Library
- ]]Woodhouse, D. JFFS: The Journaling Flash File System. Ottawa Linux Symposium, Red Hat Inc., 2001.Google Scholar
Index Terms
- The five-minute rule 20 years later (and how flash memory changes the rules)
Recommendations
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.
Enterprise Flash StorageIn 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 ...
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, ...
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 hardwareIn 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 ...
Comments