Thumbnail
Access Restriction
Subscribed

Author Bingmann, Timo ♦ Fischer, Johannes ♦ Osipov, Vitaly
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©2016
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Computer programming, programs & data
Subject Keyword I/O-efficient ♦ LCP array ♦ Suffix array ♦ External memory ♦ Secondary memory
Abstract We consider full text index construction in external memory (EM). Our first contribution is an inducing algorithm for suffix arrays in external memory, which runs in sorting complexity. Practical tests show that this algorithm outperforms the previous best EM suffix sorter [Dementiev et al., JEA 2008] by a factor of about two in time and I/O volume. Our second contribution is to augment the first algorithm to also construct the array of longest common prefixes (LCPs). This yields a new internal memory LCP array construction algorithm and the first EM construction algorithm for LCP arrays. The overhead in time and I/O volume for this extended algorithm over plain suffix array construction is roughly two. Our algorithms scale far beyond problem sizes previously considered in the literature (text size of 80GiB using only 4GiB of RAM in our experiments).
Description Author Affiliation: Karlsruhe Institute of Technology, Karlsruhe, Germany (Bingmann, Timo; Osipov, Vitaly); Technical University of Dortmund, Dortmund, Germany (Fischer, Johannes)
ISSN 10846654
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2016-09-01
Publisher Place New York
e-ISSN 10846654
Journal Journal of Experimental Algorithmics (JEA)
Volume Number 21
Page Count 27
Starting Page 1
Ending Page 27


Open content in new tab

   Open content in new tab
Source: ACM Digital Library