Hi!
Without knowing the implementation, according to my knowledge, the
entries of an unix directory are just a plain unsorted list, right?
Would it make sense to sort the whole / tree at some point by
alphabetic order or by lookup frequency to speed up lookups?
Just an idea, I have no idea if it's worth pursuing. Probably each FS
implementation has its own tree balancing method anyways.
Best regards,
Johannes