We have a Flink job that subscribes to a topic (with 10+k/sec volume) and applies tumbling windows with aggregation to create hourly buckets; each window contains a simple counter and also a HyperLogLog structure to track uniqueness estimates. We’re using the RocksDB backend. The application should be fairly simple, but it is very slow with the RocksDB backend because the windowing operation has to read, deserialize, update, serialize and write back to disk for every incoming element, which is incredibly wasteful. With HashMap backend, it works orders of magnitude faster. Is there a way to optimize how it runs on RocksDB and reduce state reads/writes in the window? For example, process incoming events in batches rather than one at a time?