Skip to content
New issue

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

ADR-101: Implement block and block results pruning mechanism #1096

Closed
1 task done
Tracked by #816
thanethomson opened this issue Jul 6, 2023 · 1 comment
Closed
1 task done
Tracked by #816

ADR-101: Implement block and block results pruning mechanism #1096

thanethomson opened this issue Jul 6, 2023 · 1 comment
Assignees
Labels
P:storage-optimization Priority: Give operators greater control over storage and storage optimization storage
Milestone

Comments

@thanethomson
Copy link
Contributor

thanethomson commented Jul 6, 2023

Before we can implement #1097, we need to implement a pruning mechanism in the codebase to facilitate pruning of blocks and block results based on a combination of the application's retain height and the retain heights set by a data companion. The implementation must follow the logic outlined in ADR-101.

This can be implemented independently of #1097 on main and be backported to v0.38.x and v0.37.x.

Tasks

  1. P:storage-optimization
    jmalicevic
@thanethomson thanethomson added storage P:storage-optimization Priority: Give operators greater control over storage and storage optimization labels Jul 6, 2023
@thanethomson thanethomson added this to the 2023-Q3 milestone Jul 6, 2023
@jmalicevic jmalicevic self-assigned this Jul 6, 2023
@thanethomson
Copy link
Contributor Author

Closed by #1150.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
P:storage-optimization Priority: Give operators greater control over storage and storage optimization storage
Projects
No open projects
Status: Done
Development

When branches are created from issues, their pull requests are automatically linked.

2 participants