Suffix tree construction algorithms on modern hardware

Suffix trees are indexing structures that enhance the performance of numerous string processing algorithms. In this paper, we propose cache-conscious suffix tree construction algorithms that are tailored to CMP architectures. The proposed algorithms utilize a novel sample-based cache partitioning algorithm to improve cache performance and exploit on-chip parallelism on CMPs. Furthermore, several compression techniques are applied to effectively trade space for cache performance. Through an extensive experimental evaluation using real text data from different domains, we demonstrate that the algorithms proposed herein exhibit better cache performance than their cache-unaware counterparts and effectively utilize all processing elements, achieving satisfactory speedup. Categories and Subject Descriptors H.3.1, H.3.4 [INFORMATION STORAGE AND RETRIEVAL]: Content Analysis and Indexing, Systems and Software. General Terms Suffix tree, Multi-core, Performance

• Type: Conference
• Year: 2010
• Where: EDBT
• Authors: Dimitris Tsirogiannis, Nick Koudas
• Keywords: Algorithms, Cache Performance, Database, EDBT 2010, Suffix Tree