Compressed index for a dynamic collection of texts

Abstract

Let T be a string with n characters over an alphabet of bounded size. The recent breakthrough on compressed indexing allows us to build an index for T in optimal space (i.e., O(n) bits), while supporting very efficient pattern matching [2, 4]. This paper extends the work on optimal-space indexing to a dynamic collection of texts. Precisely, we give a compressed index using O(n) bits where n is the total length of texts, such that searching for a pattern P takes O(|P| log n + occ log2 n) time where occ is the number of occurrences, and inserting or deleting a text T takes O(|T| log n) time. © Springer-Verlag 2004.