Process and dataflow control in distributed data-intensive systems
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
Parallel join algorithms on a network of workstations
DPDS '88 Proceedings of the first international symposium on Databases in parallel and distributed systems
VLDB '89 Proceedings of the 15th international conference on Very large data bases
CCG: a prototype coagulating code generator
PLDI '91 Proceedings of the ACM SIGPLAN 1991 conference on Programming language design and implementation
Performance evaluation of extended storage architectures for transaction processing
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
Non-volatile memory for fast, reliable file systems
ASPLOS V Proceedings of the fifth international conference on Architectural support for programming languages and operating systems
Query evaluation techniques for large databases
ACM Computing Surveys (CSUR)
The LRU-K page replacement algorithm for database disk buffering
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Self-adaptive, on-line reclustering of complex object data
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Improved query performance with variant indexes
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
BROOM: buffer replacement using online optimization by mining
Proceedings of the seventh international conference on Information and knowledge management
An optimality proof of the LRU-K page replacement algorithm
Journal of the ACM (JACM)
Crash recovery for real-time main memory database systems
SAC '96 Proceedings of the 1996 ACM symposium on Applied Computing
Impact of timing constraints on real-time database recovery
CIKM '96 Proceedings of the workshop on Databases: active and real-time
Main Memory Database Systems: An Overview
IEEE Transactions on Knowledge and Data Engineering
Design, Implementation, and Performance of the LHAM Log-Structured History Data Access Method
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Hash Joins and Hash Teams in Microsoft SQL Server
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Fido: A Cache That Learns to Fetch
VLDB '91 Proceedings of the 17th International Conference on Very Large Data Bases
Managing Memory to Meet Multiclass Workload Response Time Goals
VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases
Vertical Data Migration in Large Near-Line Document Archives Based on Markov-Chain Predictions
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
WATCHMAN: A Data Warehouse Intelligent Cache Manager
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
The LHAM log-structured history data access method
The VLDB Journal — The International Journal on Very Large Data Bases
Integrated document caching and prefetching in storage hierarchies based on Markov-chain predictions
The VLDB Journal — The International Journal on Very Large Data Bases
Data placement in shared-nothing parallel database systems
The VLDB Journal — The International Journal on Very Large Data Bases
Opportunistic prioritised clustering framework for improving OODBMS performance
Journal of Systems and Software
Path and cache conscious prefetching (PCCP)
The VLDB Journal — The International Journal on Very Large Data Bases
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 hardware
Database servers tailored to improve energy efficiency
SETMDM '08 Proceedings of the 2008 EDBT workshop on Software engineering for tailor-made data management
The Five-Minute Rule 20 Years Later: and How Flash Memory Changes the Rules
Queue - Enterprise Flash Storage
The five-minute rule 20 years later (and how flash memory changes the rules)
Communications of the ACM - Barbara Liskov: ACM's A.M. Turing Award Winner
The case for RAMClouds: scalable high-performance storage entirely in DRAM
ACM SIGOPS Operating Systems Review
Communications of the ACM
TritonSort: a balanced large-scale sorting system
Proceedings of the 8th USENIX conference on Networked systems design and implementation
Authenticated Dictionaries: Real-World Costs and Trade-Offs
ACM Transactions on Information and System Security (TISSEC)
CloudRAMSort: fast and efficient large-scale distributed RAM sort on shared-nothing cluster
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
Optimal Web cache sizing: scalable methods for exact solutions
Computer Communications
Janus: optimal flash provisioning for cloud storage workloads
USENIX ATC'13 Proceedings of the 2013 USENIX conference on Annual Technical Conference
| Hi-index | 0.02 |
If an item is accessed frequently enough, it should be main memory resident. For current technology, “frequently enough” means about every five minutes.Along a similar vein, one can frequently trade memory space for CPU time. For example, bits can be packed in a byte at the expense of extra instructions to extract the bits. It makes economic sense to spend ten bytes of main memory to save one instruction per second.These results depend on current price ratios of processors, memory and disc accesses. These ratios are changing and hence the constants in the rules are changing.