@InProceedings{ferragina:soda96,
  author = {Paolo Ferragina and Roberto Grossi},
  title = {Fast String Searching in Secondary Storage: Theoretical Developments
  and Experimental Results},
  booktitle = {Proceedings of the ACM-SIAM Symposium on Discrete Algorithms
  (SODA `96)},
  year = {1996},
  month = {June},
  pages = {373--382},
  publisher = {ACM Press},
  address = {Atlanta},
  URL = {http://www.di.unipi.it/~ferragin/Latex/jsoda96.ps.gz},
  keywords = {out-of-core algorithm, parallel I/O, pario-bib},
  abstract = {In a previous work [Ferragina-Grossi, ACM STOC 95], we proposed a
  text indexing data structure for secondary storage, which we called SB-tree,
  that combines the best of B-trees and suffix arrays, overcoming the
  limitations of inverted files, suffix arrays, suffix trees, and prefix
  B-trees. In this paper we study the performance of SB-trees in a practical
  setting, performing a set of searching and updating experiments. Improved
  performance was obtained by a new space efficient and alphabet-independent
  organization of the internal nodes of the SB-tree, and a new batch insertion
  procedure that avoids thrashing.}
}