Comments (2)
I think that makes sense. That will support a more efficient implementation because we will know statically what is the next entry to evict based on time to live and when to evict it versus having to potentially traverse the entire cache to see if items need to be evicted (assuming they aren't accessed and evicted then).
from zio-cache.
The cache can remain as flexible as it is (Priority-based eviction for clearing space when needed) and also support TTL-based expiration efficiently. In order to accomplish this, I believe there are a couple of changes that would need to be made (inline with this story and #6 )
- Add an efficient data structure for ordering items by when they will expire.
- Rework the Evict logic to get rid of taking
Instant.now
as one of its parameters.
Overview of Potential Cache Strategy
There are two questions we need to answer for caching, taking into account the user-defined priorities:
- What is the next item that will expire based on TTL?
- What item should I evict now based on my prioritization because I no longer have capacity?
(1) Can be used to implement a ticker in a daemon fiber that evicts expired cache entries
(2) Can be used to free up space when it is needed
In order two support both operations efficiently, the cache needs to be composed of three data structures:
- A Map[Key, Entry[Value]] - already exists
- A SortedSet (maybe switch to BTree or BinaryTree) of prioritized cached entries - already exists
- A SortedSet (BTree or BinaryTree potentially) of ordered entries by TTL
from zio-cache.
Related Issues (20)
- Allow batch lookups HOT 1
- Delete Lookup?
- Ability to transform value HOT 1
- Alternative cost/weight per entry HOT 1
- Looking up an expired item increases both the 'hits' and 'misses' stats of the cache.
- Compat with ZIO 2.1.0-RC2 HOT 1
- Ability to trigger a lookup call deliberately
- Ability to clear the cache
- Ability to add callback/hook to expiry events
- Ability to iterate/query items in the cache HOT 1
- Ability to set an initial size in addition to `capacity`?
- Provide more stats in `CacheStats`
- Force specifying a name / description for the cache when a cache is created
- Support managed cached values HOT 6
- Add tests to cover more complex scenarios and cross-platform cases. HOT 2
- Test fails when executed in IntelliJ HOT 3
- Ability to set expiry time from lookup function HOT 1
- Refined result from `get`
- Optional jitter for the cache ttl
- Enhance cache lookup HOT 5
Recommend Projects
-
React
A declarative, efficient, and flexible JavaScript library for building user interfaces.
-
Vue.js
🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.
-
Typescript
TypeScript is a superset of JavaScript that compiles to clean JavaScript output.
-
TensorFlow
An Open Source Machine Learning Framework for Everyone
-
Django
The Web framework for perfectionists with deadlines.
-
Laravel
A PHP framework for web artisans
-
D3
Bring data to life with SVG, Canvas and HTML. 📊📈🎉
-
Recommend Topics
-
javascript
JavaScript (JS) is a lightweight interpreted programming language with first-class functions.
-
web
Some thing interesting about web. New door for the world.
-
server
A server is a program made to process requests and deliver data to clients.
-
Machine learning
Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.
-
Visualization
Some thing interesting about visualization, use data art
-
Game
Some thing interesting about game, make everyone happy.
Recommend Org
-
Facebook
We are working to build community through open source technology. NB: members must have two-factor auth.
-
Microsoft
Open source projects and samples from Microsoft.
-
Google
Google ❤️ Open Source for everyone.
-
Alibaba
Alibaba Open Source for everyone
-
D3
Data-Driven Documents codes.
-
Tencent
China tencent open source team.
from zio-cache.