A Compressed Text Index on Secondary Memory

dc.creatorGonzález González, Rodrigo
dc.creatorNavarro, Gonzalo
dc.date.accessioned2014-01-10T13:50:13Z
dc.date.available2014-01-10T13:50:13Z
dc.date.created2014-01-10T13:50:13Z
dc.date.issued2009
dc.identifierJournal of Combinatorial Mathematics and Combinatorial Computing (2009), 71, 127.
dc.identifierhttps://repositorio.uchile.cl/handle/2250/126172
dc.description.abstractWe introduce a practical disk-based compressed text index that, when the text is compressible, takes little more than the plain text size (and replaces it). It provides very good I/O times for searching, which in particular improve when the text is compressible. In this aspect our index is unique, as compressed indexes have been slower than their classical counterparts on secondary memory. We analyze our index and show experimentally that it is extremely competitive on compressible texts.
dc.languageen
dc.publisherJCMCC
dc.rightshttp://creativecommons.org/licenses/by-nc-nd/3.0/cl/
dc.rightsAttribution-NonCommercial-NoDerivs 3.0 Chile
dc.titleA Compressed Text Index on Secondary Memory
dc.typeArtículo de revista


Este ítem pertenece a la siguiente institución