Store words for lexicographic range queries
Design storage for a set of words that returns every word in a lexicographic range [low, high]. For the words aa, aaa, ac, f, z, the range [a, b] gives aa, aaa, ac and [ab, b] gives ac. Discuss sorted structures (balanced trees, tries, B-trees, sorted files), inserts, and how it scales beyond one machine.
GoogleSystem designNo answer yet. Write the first one; the best answer gets endorsed.