Especially for non-equality comparisons; and sorting.
If it is equality; maybe it is like a sorted hashtable? Not that I know much about how hashtable work...
But what about
string case-insensitive operations? What are possible ways to optimize this (probably on write)?