I know that frequent excision is cautioned against and this might be an XY problem, but hypothetically if I used a date-based partitioning strategy and excised entire partitions at a time am I correct in thinking there'd be relatively little work involved for the transactor? My mental model is that partitions are branches in the sorted set indices and so a transaction that removed all entities in a partition would prune a branch from the tree and not need to do much sorting / reindexing?
that strategy helps in EAVT and AEVT (e-leading sorts), but not in AVET or VAET and excising the log is always brutal
that makes sense. i thought it might help in VAET too since V is only refs (eids?)
it could