100
104
Many performance problems only become visible when changing the scaling knobs
101
105
upwards to large trees. On small trees its our baseline performance that drives
102
106
incremental improvements; on large trees its the amount of processing per item
104
108
data to be processed under control. Ideally we can scale in a sublinear fashion
105
109
for all operations, but we MUST NOT scale even linearly for operations that
106
110
invoke a latency multiplier. For example, reading a file on disk requires