Algorithms and Data Structures for External Memory

14
String Processing
In this chapter, we survey methods used to process strings in external
memory, such as inverted files, search trees, suffix trees, suffix arrays,
and sorting, with particular attention to more recent developments.
For the case of strings we make the following modifications to our
standard notation:
K = number of strings;
N = total length of all strings (in units of characters);
M = internal memory size (in units of characters);
B = block transfer size (in units of characters).
where M