Skip to main content Link Search Menu Expand Document (external link)

Scalable Construction of Text Indexes with Thrill

DOI arXiv pdf code


The suffix array is the key to efficient solutions for myriads of string processing problems in different application domains, like data compression, data mining, or bioinformatics. With the rapid growth of available data, suffix array construction algorithms have to be adapted to advanced computational models such as external memory and distributed computing. In this article, we present five suffix array construction algorithms utilizing the new algorithmic big data batch processing framework Thrill, which allows scalable processing of input sizes on distributed systems in orders of magnitude that have not been considered before.


  author    = {Timo Bingmann and Simon Gog and Florian Kurpicz},
  title     = {Scalable Construction of Text Indexes with Thrill},
  booktitle = {IEEE BigData},
  pages     = {634–643},
  publisher = {IEEE},
  doi       = {10.1109/BigData.2018.8622171},
  year      = {2018}