Principles of transaction-oriented database recovery
ACM Computing Surveys (CSUR)
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
RAID: high-performance, reliable secondary storage
ACM Computing Surveys (CSUR)
Implementing a generalized access path structure for a relational database system
ACM Transactions on Database Systems (TODS)
ACM Transactions on Database Systems (TODS)
Operating system support for database management
Communications of the ACM
AlphaSort: a cache-sensitive parallel external sort
The VLDB Journal — The International Journal on Very Large Data Bases
PDIS '93 Proceedings of the 2nd International Conference on Parallel and Distributed Information Systems
Cache Conscious Algorithms for Relational Query Processing
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
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)
JouleSort: a balanced energy-efficiency benchmark
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Query processing techniques for solid state drives
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Tree indexing on solid state drives
Proceedings of the VLDB Endowment
B+-tree index optimization by exploiting internal parallelism of flash-based solid state drives
Proceedings of the VLDB Endowment
Hybrid storage management for database systems
Proceedings of the VLDB Endowment
| Hi-index | 0.00 |
The old rule continues to evolve, while flash memory adds two new rules. In 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 each time the record (or page) is accessed, using appropriate fractions of prices for RAM chips and disk drives. The name of their rule refers to the break-even interval between accesses. If a record (or page) is accessed more often, it should be kept in memory; otherwise, it should remain on disk and read when needed.