To make my scenario clearer: I am reading all pages (as in pagination) of the same query possibly over a long period of time (minutes or hours) targeting all alpha nodes of the cluster. Some pages might be read multiple times. As mutations could occur concurrently (adding triples, changing object of predicates, removing triples), all pages are read with the same
startTs to keep those later changes out of the query results.
As I understand the rollups: insertions, modifications and deletions will be applied and earlier state will not be available anymore, hence queries must return an error from that point on to avoid inconsistency.
Can you give any numbers on how long a transaction is guaranteed to exist? Like after how many mutations a rollup may or does occur?
If this all depends on data ingestion speed, which is totally fine and understandable, the warranty needs to be objectively defined. When exactly / roughly can I expect it to be guaranteed and when to be void?