Leaf node size varies depending on the keys stored to it but the default size is a few cache lines. Unlike
B-, and binary trees Vtrie does not execute any comparisons during tree traversal. Each part of a key is applied
as an array index to a pointer array of a child node. Contrary to a value comparison, array lookup is a fast
operation if the array is cached in processor caches. When individual array index is sparsely populated, it is
compressed to avoid unnecessary cache misses. Finally, on the leaf level, row key lookup is performed by
scanning prefix-compressed keys in cache-aligned leaf node.