ben-manes/caffeine
Caffeine
Caffeine is a high-performance caching library for the Java virtual machine designed to manage object lifecycles within the application heap. It functions as a thread-safe, memory-resident data store that reduces latency by keeping frequently accessed objects available for immediate retrieval.
The library distinguishes itself through a sophisticated eviction strategy that balances recency and frequency to determine which entries to retain. It utilizes a frequency-based admission policy to evaluate the historical access patterns of new data, ensuring that the cache remains populated with the most relevant information. To maintain high throughput under concurrent access, the system employs lock-free event processing and segmented storage to minimize contention.
Beyond its core storage capabilities, the library provides automated mechanisms for data loading and entry eviction based on size, time, or reference strength. It also includes built-in support for monitoring and observability, allowing developers to track hit and miss rates alongside eviction counts to inform memory management decisions.
Features
- Caching Libraries - Provides a high-performance caching library for the Java virtual machine with automatic eviction and data loading.
- Concurrent Caches - Provides a thread-safe data structure designed for high-concurrency environments to manage object lifecycles.
- In-Memory Data Stores - Functions as a memory-resident storage mechanism that reduces application latency by caching objects in the heap.
- Frequency-Based Admission - Uses a frequency-based sketch to decide whether new entries deserve a spot in the cache based on historical access patterns.
- Automatic Cache Loaders - Populating cache entries automatically when a requested key is missing by executing a provided function to fetch the required value.
- Caching - Caches frequently accessed data in memory to improve application performance by avoiding repeated expensive lookups.
- In-Memory Caches - Stores frequently accessed objects in the application heap to reduce latency and avoid redundant computations.
- Caching - High-performance, near-optimal caching library.
- Caching Solutions - High-performance near-optimal caching library.
- Data Structures and Memory - A high performance caching library for Java 8.
- Caching - High-performance Java caching library with near-optimal eviction policies.
- Cache Eviction Policies - Removes cache items automatically based on size limits, time-based expiration, or reference strength.
- In-Memory Caching - Maintains in-memory caches to reduce latency and improve application performance.
- Lock-Free Buffers - Buffers high-frequency write operations into a lock-free queue to minimize contention and maintain high throughput.
- On-Demand Loaders - Populates cache entries automatically when a requested key is missing by executing a provided function.
- Lazy Expiration - Cleans up expired entries during access to avoid background thread overhead and latency spikes.
- Hash Tables - Organizes data into multiple independent hash segments to reduce lock contention and allow parallel access.
- Cache Performance Metrics - Tracks hit and miss rates alongside eviction counts to gain visibility into memory usage and performance.
