Details
-
Improvement
-
Status: Open
-
Major
-
Resolution: Unresolved
-
None
-
None
-
None
-
None
Description
The problem with this data structure is that the key is not time based.
This poses a problem because we will have a problem purging.
One idea is to have `put` write the key and the window set to the timebucket that the latest window in that set belongs to, which means possible duplication of the key and the window set, and make `get` do a for loop on all time buckets to find the key. That way, purging based on the time bucket can still be done.
Attachments
Issue Links
- is related to
-
APEXMALHAR-2130 Scalable windowed storage
- Closed
- relates to
-
APEXMALHAR-2244 Optimize WindowedStorage and Spillable data structures for time series
- Closed
- links to