Sounds like you can simply store all 5 latest entries as a single entry and update the collection atomically using entry processor and invoke() method (check current size within entry processor and remove oldest element if needed). Once updated, you can do the computation. Will this work for you?
Another possible approach is to implement custom eviction policy. Similar to LruEvictionPolicy, but with a queue per affinity key. -Val -- View this message in context: http://apache-ignite-users.70518.x6.nabble.com/Streaming-Sliding-Window-question-tp10022p10045.html Sent from the Apache Ignite Users mailing list archive at Nabble.com.
