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, DaMoN '07

Volumn , Issue , 2007, Pages

  Graefe, Goetz ^a  

^a HEWLETT PACKARD LABORATORIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ACCESS LATENCY; ACQUISITION COSTS; DISK SYSTEMS; FAST TRANSFER; FILE SYSTEMS; FLASH DISKS; MAIN MEMORY; OPERATING SYSTEMS; POWER CONSUMPTION; SPATIAL DENSITIES; SYSTEM ARCHITECTURES;

BANDWIDTH; COMPUTER OPERATING SYSTEMS; DATABASE SYSTEMS; DISKS (MACHINE COMPONENTS); DISKS (STRUCTURAL COMPONENTS); SOFTWARE ARCHITECTURE;

FLASH MEMORY;

EID: 77952391462     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1363189.1363198     Document Type: Conference Paper

References (25)

1. [BDC 05] Michael A. Bender, Erik D. Demaine, Martin Farach-Colton: Cache-Oblivious B-Trees. SIAM J. Comput. 35 (2):341-358 (2005).
2. [BM 70] Rudolf Bayer, Edward M. McCreight: Organization and Maintenance of Large Ordered Indexes. SIG-FIDET Workshop 1970:107-141.
3. [BU 77] Rudolf Bayer, Karl Unterauer: Prefix B-Trees. ACM TODS 2 (1):11-26 (1977).
4. [CDR 89] Michael J. Carey, David J. DeWitt, Joel E. Richardson, Eugene J. Shekita: Storage Management in EXODUS. Object-Oriented Concepts, Databases, and Applications 1989:341-369.
5. [CLG 94] Peter M. Chen, Edward L. Lee, Garth A. Gibson, Randy H. Katz, David A. Patterson: RAID: High-Performance, Reliable Secondary Storage ACM Comput. Surv. 26 (2):145-185 (1994).
6. [DNB 93] David J. DeWitt, Jeffrey F. Naughton, Joseph Burger: Nested Loops Revisited. PDIS 1993:230-242.
7. [G 03] Goetz Graefe: Executing Nested Queries. BTW 2003:58-77.
8. [G 04] Goetz Graefe: Write-Optimized B-Trees. VLDB 2004:672-683.
9. [G 06] Goetz Graefe: Implementing Sorting in Database Systems. ACM Comput. Surv. 38 (3): (2006).
10. [G 07] Goetz Graefe: Master-detail clustering using merged indexes. Informatik - Forschung und Entwicklung (2007).
11. [GF 07] Jim Gray, Bob Fitzgerald: FLASH Disk Opportunity for Server-Applications. http://research.microsoft.com/∼gray/papers/ FlashDiskPublic.doc.
12. [GG 97] Jim Gray, Goetz Graefe: The Five-Minute Rule Ten Years Later, and Other Computer Storage Rules of Thumb. SIGMOD Record 26 (4):63-68 (1997).
13. [GP 87] Jim Gray, Gianfranco R. Putzolu: The 5 Minute Rule for Trading Memory for Disk Accesses and The 10 Byte Rule for Trading Memory for CPU Time. SIGMOD 1987:395-398.
14. [H 78] Theo Härder: Implementing a Generalized Access Path Structure for a Relational Database System. ACM TODS 3 (3):285-298 (1978).
15. [H 07] James Hamilton: An Architecture for Modular Data Centers. CIDR 2007.
16. [HR 83] Theo Härder, Andreas Reuter: Principles of Transaction-Oriented Database Recovery. ACM Comput. Surv. 15 (4):287-317 (1983).
17. [L 01] David B. Lomet: The Evolution of Effective B-tree Page Organization and Techniques: A Personal Account. SIGMOD Record 30 (3):64-69 (2001).
18. [LR 07] James R. Larus, Ravi Rajwar: Transactional Memory. Synthesis Lectures on Computer Architecture, Morgan & Claypool (2007).
19. [NBC 95] Chris Nyberg, Tom Barclay, Zarka Cvetanovic, Jim Gray, David B. Lomet: AlphaSort: A Cache-Sensitive Parallel External Sort VLDB J. 4 (4):603-627 (1995).
20. [OD 89] John K. Ousterhout, Fred Douglis: Beating the I/O Bottleneck: A Case for Log-Structured File Systems. Operating Systems Review 23 (1):11-28 (1989).
21. [O 92] Patrick E. O'Neil: The SB-Tree: An Index-Sequential Structure for High-Performance Sequential Access. Acta Inf. 29 (3):241-265 (1992).
22. [RSK 07] Suzanne Rivoire, Mehul Shah, Partha Ranganathan, Christos Kozyrakis: JouleSort: A Balanced Energy-Efficiency Benchmark. SIGMOD 2007.
23. [S 81] Michael Stonebraker: Operating System Support for Database Management. CACM 24 (7):412-418 (1981).
24. [SKN 94] Ambuj Shatdal, Chander Kant, Jeffrey F. Naughton: Cache Conscious Algorithms for Relational Query Processing. VLDB 1994:510-521.
25. [W 01] David Woodhouse: JFFS: the Journaling Flash File System. Ottawa Linux Symposium, Red Hat Inc, 2001.