ERA: Efficient serial and parallel suffix tree construction for very long strings

Citation data:

Proceedings of the VLDB Endowment, ISSN: 2150-8097, Vol: 5, Issue: 1, Page: 49-60

Publication Year:
2011
Usage 5
Abstract Views 5
Mentions 1
References 1
Citations 23
Citation Indexes 23
Repository URL:
http://hdl.handle.net/10754/561870
DOI:
10.14778/2047485.2047490
Author(s):
Mansour, Essam; Allam, Amin; Skiadopoulos, Spiros G.; Kalnis, Panos
Publisher(s):
VLDB Endowment
Tags:
Computer Science
article description
The suffix tree is a data structure for indexing strings. It is used in a variety of applications such as bioinformatics, time series analysis, clustering, text editing and data com-pression. However, when the string and the resulting suffix tree are too large to fit into the main memory, most existing construction algorithms become very inefficient. This paper presents a disk-based suffix tree construction method, called Elastic Range (ERa), which works efficiently with very long strings that are much larger than the available memory. ERa partitions the tree construction process hor-izontally and vertically and minimizes I/Os by dynamically adjusting the horizontal partitions independently for each vertical partition, based on the evolving shape of the tree and the available memory. Where appropriate, ERa also groups vertical partitions together to amortize the I/O cost. We developed a serial version; a parallel version for shared-memory and shared-disk multi-core systems; and a parallel version for shared-nothing architectures. ERa indexes the entire human genome in 19 minutes on an ordinary desk-top computer. For comparison, the fastest existing method needs 15 minutes using 1024 CPUs on an IBM BlueGene supercomputer. © 2011 VLDB Endowment.