We study parallel and distributed compressed indexes. Compressed indexes are a new and functional way to index text strings. They exploit the compressibility of the text, so that their size is a function of the compressed text size. Moreover, they support a considerable amount of functions, more than many classical indexes. We make use of this extended functionality to obtain, in a shared-memory parallel machine, near-optimal speedups for solving several stringology problems. We also show how to distribute compressed indexes across several machines. © Springer-Verlag Berlin Heidelberg 2010.
CITATION STYLE
Russo, L. M. S., Navarro, G., & Oliveira, A. L. (2010). Parallel and distributed compressed indexes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6129 LNCS, pp. 348–360). https://doi.org/10.1007/978-3-642-13509-5_31
Mendeley helps you to discover research relevant for your work.