BROOM: buffer replacement using online optimization by mining
Proceedings of the seventh international conference on Information and knowledge management
Sibling clustering of tree-based spatial indexes for efficient spatial query processing
Proceedings of the seventh international conference on Information and knowledge management
B-tree page size when caching is considered
ACM SIGMOD Record
Locality preserving dictionaries: theory & application to clustering in databases
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Ripple joins for online aggregation
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
A cache filtering optimisation for queries to massive datasets on tertiary storage
Proceedings of the 2nd ACM international workshop on Data warehousing and OLAP
Comparing random data allocation and data striping in multimedia servers
Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
B+ retake: sustaining high volume inserts into large data pages
Proceedings of the 4th ACM international workshop on Data warehousing and OLAP
A locality-preserving cache-oblivious dynamic dictionary
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Fractal prefetching B+-Trees: optimizing both cache and disk performance
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Disk scheduling policies with lookahead
ACM SIGMETRICS Performance Evaluation Review
Informix under CONTROL: Online Query Processing
Data Mining and Knowledge Discovery
The ADABAS Buffer Pool Manager
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Performance Measurements of Tertiary Storage Devices
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Similarity Search for Adaptive Ellipsoid Queries Using Spatial Transformation
Proceedings of the 27th International Conference on Very Large Data Bases
Scanning and Traversing: Maintaining Data for Traversals in a Memory Hierarchy
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Clustered Indexing Technique for Multidimensional Index Structures
DEXA '02 Proceedings of the 13th International Conference on Database and Expert Systems Applications
Effect of node size on the performance of cache-conscious B+-trees
SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
The VLDB Journal — The International Journal on Very Large Data Bases
Controlled Buffer Sharing in Continuous Media Servers
Multimedia Tools and Applications
A locality-preserving cache-oblivious dynamic dictionary
Journal of Algorithms
Decision support queries on a tape-resident data warehouse
Information Systems
B-tree indexes, interpolation search, and skew
DaMoN '06 Proceedings of the 2nd international workshop on Data management on new hardware
ACM Transactions on Storage (TOS)
FlashDB: dynamic self-tuning database for NAND flash
Proceedings of the 6th international conference on Information processing in sensor networks
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
A multi-version cache replacement and prefetching policy for hybrid data delivery environments
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
μ-tree: an ordered index structure for NAND flash memory
EMSOFT '07 Proceedings of the 7th ACM & IEEE international conference on Embedded software
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
The Five-Minute Rule 20 Years Later: and How Flash Memory Changes the Rules
Queue - Enterprise Flash Storage
Proceedings of the VLDB Endowment
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
B-tries for disk-based string management
The VLDB Journal — The International Journal on Very Large Data Bases
Warm cache costing: a feedback optimization technique for buffer pool aware costing
Proceedings of the 13th International Conference on Extending Database Technology
On the impact of flash SSDs on spatial indexing
Proceedings of the Sixth International Workshop on Data Management on New Hardware
Index vs. navigation in XPath evaluation
XSym'06 Proceedings of the 4th international conference on Database and XML Technologies
An on-line reorganization framework for SAN file systems
ADBIS'06 Proceedings of the 10th East European conference on Advances in Databases and Information Systems
Foundations and Trends in Databases
bLSM: a general purpose log structured merge tree
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
CloudOptimizer: multi-tenancy for I/O-bound OLAP workloads
Proceedings of the 16th International Conference on Extending Database Technology
Hi-index | 0.00 |
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, five minutes is a good lifetime for randomly accessed pages, one minute is a good lifetime for two-pass sequentially accessed pages, and 16 KB is a good size for index pages. These rules-of-thumb change in predictable ways as technology ratios change. They also motivate the importance of the new Kaps, Maps, Scans, and $/Kaps, $/Maps, $/TBscan metrics.