Compressed Suffix Arrays for Massive Data

Show full item record

Title: Compressed Suffix Arrays for Massive Data
Author: Sirén, Jouni
Abstract: We present a fast space-efficient algorithm for constructing compressed suffix arrays (CSA). The algorithm requires O(n log n) time in the worst case, and only O(n) bits of extra space in addition to the CSA. As the basic step, we describe an algorithm for merging two CSAs. We show that the construction algorithm can be parallelized in a symmetric multiprocessor system, and discuss the possibility of a distributed implementation. We also describe a parallel implementation of the algorithm, capable of indexing several gigabytes per hour.
Date: 2009-06-15

Files in this item

Total number of downloads: Loading...

Files Size Format View
paper.pdf 176.4Kb PDF View/Open

This item appears in the following Collection(s)

Show full item record