perf: optimize hash naming for MySQL storage #25309
Merged
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
InnoDB is "index organized"* and the primary key is that index. So random names can send rows all over the place.
Typically documents created closer in time should live closer on mysql pages too.
Test: I created a DocType with 300 documents and each containing 1000 child table rows.
Pages read numbers are mostly meaningless as they depend on # of rows read. The general idea is previously number of pages read was proportional to the number of rows read because of random distribution of data. The proportionality factor being how many rows can fit in single 16KB page.
Notes:
TODO:
* - https://15445.courses.cs.cmu.edu/fall2023/slides/04-storage2.pdf (page 25)