Show simple item record

Authordc.contributor.authorGonzález González, Rodrigo 
Authordc.contributor.authorNavarro, Gonzalo es_CL
Admission datedc.date.accessioned2014-01-10T13:50:13Z
Available datedc.date.available2014-01-10T13:50:13Z
Publication datedc.date.issued2009
Cita de ítemdc.identifier.citationJournal of Combinatorial Mathematics and Combinatorial Computing (2009), 71, 127.en_US
Identifierdc.identifier.urihttps://repositorio.uchile.cl/handle/2250/126172
Abstractdc.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.en_US
Lenguagedc.language.isoenen_US
Publisherdc.publisherJCMCCen_US
Type of licensedc.rightsAttribution-NonCommercial-NoDerivs 3.0 Chile*
Link to Licensedc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/cl/*
Títulodc.titleA Compressed Text Index on Secondary Memoryen_US
Document typedc.typeArtículo de revista


Files in this item

Icon

This item appears in the following Collection(s)

Show simple item record

Attribution-NonCommercial-NoDerivs 3.0 Chile
Except where otherwise noted, this item's license is described as Attribution-NonCommercial-NoDerivs 3.0 Chile