Suffix sorting is the foundation of the suffix array, one of the most well-researched text data structures. While there are different implementations of multiple suffix sorting algorithms, there is no benchmark comparing them all. We provide an easily extendable benchmark framework for suffix sorting.
The framework is the main result of a project group, which is a mandatory course here at TU Dortmund where 12 students participate over two semesters, that was supervised by Prof. Dr. Johannes Fischer and me.
The SACABench benchmark framework is available at https://github.com/sacabench/sacabench. If you implement a new suffix sorting algorithm, then feel free to include it in the framework, or drop me a message such that I can include it. This helps to keep the benchmark up to date.