We'd like to understand the database shape better, the metrics we're interested in include:

• Tree shape
• WiredTiger overhead
• Compression ratio

To gather these metrics we can leverage an existing tree walk algorithm: session->verify. Verify already walks the provided tree, scanning each leaf node we can then aggregate up the metrics required and log a message containing the information.

This message can then be grepped for and stored in a database somewhere to run queries against.

A poc of this mechanism already exists, therefore the work described in this ticket is to:s

• Analyze the PoC against the specification in the technical design
• Cleanup where necessary
• Add testing & Merge