The new version of this tool now estimates the locality of a DB
written using the "grandchild" strategy implemented by
types.ValueStore. It does do by dividing each level of the graph
up into groups that are roughly the size of the branching factor
of that level, and then calculating how many physical reads are
needed to read each group.
In the case of perfect locality, each group could be read in a
single physical read, so that's what the tool uses as its estimate
of the optimal case.
The new version of this tool now estimates the locality of a DB written using the "grandchild" strategy implemented by types.ValueStore. It does do by dividing each level of the graph up into groups that are roughly the size of the branching factor of that level, and then calculating how many physical reads are needed to read each group.
In the case of perfect locality, each group could be read in a single physical read, so that's what the tool uses as its estimate of the optimal case.
Toward #2968