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

Authors:
Goetz Graefe
Affiliations:
Microsoft
Venue:
Communications of the ACM - Barbara Liskov: ACM's A.M. Turing Award Winner
Year:
2009

Citing 19
Cited 8

Principles of transaction-oriented database recovery

ACM Computing Surveys (CSUR)
The 5 minute rule for trading memory for disc accesses and the 10 byte rule for trading memory for CPU time

SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
Beating the I/O bottleneck: a case for log-structured file systems

ACM SIGOPS Operating Systems Review
Storage management for objects in EXODUS

Object-oriented concepts, databases, and applications
The SB-tree: an index-sequential structure for high-performance sequential access

Acta Informatica
Query evaluation techniques for large databases

ACM Computing Surveys (CSUR)
RAID: high-performance, reliable secondary storage

ACM Computing Surveys (CSUR)
The five-minute rule ten years later, and other computer storage rules of thumb

ACM SIGMOD Record
Implementing a generalized access path structure for a relational database system

ACM Transactions on Database Systems (TODS)
Prefix B-trees

ACM Transactions on Database Systems (TODS)
Operating system support for database management

Communications of the ACM
The evolution of effective B-tree: page organization and techniques: a personal account

ACM SIGMOD Record
AlphaSort: a cache-sensitive parallel external sort

The VLDB Journal — The International Journal on Very Large Data Bases
Data page layouts for relational databases on deep memory hierarchies

The VLDB Journal — The International Journal on Very Large Data Bases
Nested Loops Revisited

PDIS '93 Proceedings of the 2nd International Conference on Parallel and Distributed Information Systems
Cache-Oblivious B-Trees

SIAM Journal on Computing
Implementing sorting in database systems

ACM Computing Surveys (CSUR)
Transactional Memory (Synthesis Lectures on Computer Architecture)

Transactional Memory (Synthesis Lectures on Computer Architecture)
Write-optimized B-trees

VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30

Flashing databases: expectations and limitations

Proceedings of the Sixth International Workshop on Data Management on New Hardware
SSD-HDD-hybrid virtual disk in consolidated environments

Euro-Par'09 Proceedings of the 2009 international conference on Parallel processing
Energy efficiency is not enough, energy proportionality is needed!

DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications
FB-tree: a B+-tree for flash-based SSDs

Proceedings of the 15th Symposium on International Database Engineering & Applications
A survey of B-tree logging and recovery techniques

ACM Transactions on Database Systems (TODS)
Modern B-Tree Techniques

Foundations and Trends in Databases
TL-Tree: flash-optimized storage for time-series sensing data on sensor platforms

Proceedings of the 27th Annual ACM Symposium on Applied Computing
The impact of solid state drive on search engine cache management

Proceedings of the 36th international ACM SIGIR conference on Research and development in information retrieval

Quantified Score

Hi-index	0.00

Visualization

Abstract

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