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

Speeding up indexing by exploiting temporal locality of UTXO use. #703

Merged
merged 28 commits into from
Oct 25, 2022

Conversation

veryordinally
Copy link
Collaborator

Working on issue #371
Most UTXOs are short-lived so to speed up indexing, we introduce an in-memory HashMap that collects all outpoint-to-ordinal-range mappings since the last DB commit, and serves as a cache. On mainnet this avoids around 80% of the writes to the redb BTree and results in a 2x speedup for indexing at the expense of slightly higher RAM usage.
Also introduces more detailed logging and time keeping.

Also, this includes #702, not sure how to pull these two apart.

Working on issue ordinals#371
Most UTXOs are short-lived so to speed up indexing, we introduce an in-memory HashMap that collects all outpoint-to-ordinal-range mappings since the last DB commit, and serves as a cache. On mainnet this avoids around 80% of the writes to the redb BTree and results in a 2x speedup for indexing at the expense of slightly higher RAM usage.
Also introduces more detailed logging and time keeping.
@casey casey merged commit 6a09a2d into ordinals:master Oct 25, 2022
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

None yet

2 participants