We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
We should be more space efficient in cases like rolling-window row key spaces.
This can be done with an update committer that iterates rows in reclaimed (= current - previous) and current block-wise:
reclaimed
= current - previous
current
impactedBlock
This should let us determine blocks to remove, possibly more complicated in the sparse (multi-level) case.
The text was updated successfully, but these errors were encountered:
rcaudy
No branches or pull requests
We should be more space efficient in cases like rolling-window row key spaces.
This can be done with an update committer that iterates rows in
reclaimed
(= current - previous
) andcurrent
block-wise:impactedBlock
. Advance to next block.impactedBlock
, calculate the block start and end. Determine if there are any rows between start and end present in current, advance to after end.This should let us determine blocks to remove, possibly more complicated in the sparse (multi-level) case.
The text was updated successfully, but these errors were encountered: