Abstract
The present disclosure relates to the field of data processing, in particular to a time-based cleanup cache for optimizing deduplication in transaction processing systems. The cache organizes deduplication entries based on transaction dates and maintains only a minimal composite key required for unique identification, thereby improving both memory utilization and operational efficiency. The cache employs a deterministic cleanup process, wherein expired entries are automatically removed at predefined intervals, ensuring consistent performance and scalability under varying traffic conditions. Further, the cache is integrated into existing statestore workflows for replay validation and includes configurable capacity constraints, thereby enhancing service reliability, reducing infrastructure costs, and supporting complex data operations. The design provides predictable performance and resource savings over conventional cache strategies, particularly in mission-critical event processing environments.
Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 License.
Recommended Citation
Vighnesh, R V, "REPLAY TIME BASED CLEANUP CACHE", Technical Disclosure Commons, (January 11, 2026)
https://www.tdcommons.org/dpubs_series/9168