dc.creatorBonacic Castro, Carolina
dc.creatorFariña, Antonio
dc.creatorMarín, Mauricio
dc.creatorBrisaboa, Nieves R.
dc.date.accessioned2013-12-23T17:11:12Z
dc.date.available2013-12-23T17:11:12Z
dc.date.created2013-12-23T17:11:12Z
dc.date.issued2004
dc.identifierhttps://repositorio.uchile.cl/handle/2250/125831
dc.description.abstractSystems able to cope with very large text collections are making intensive use of distributed memory parallel computing platforms such as Clusters of PCs. This is particularly evident in Web Search Engines which must resort to parallelism in order to deal efficiently with both high rates of queries per unit time and high space requirements in the form of large numbers of small documents stored in secondary memory. Those documents can be stored in compressed format to reduce memory space and communication time. This paper proposes a parallel algorithm for compressing text in such a distributed memory environment. We show efficient performance against the usual-practice alternative of compressing the whole text on a single machine
dc.languageen_US
dc.rightshttp://creativecommons.org/licenses/by-nc-nd/3.0/cl/
dc.rightsAttribution-NonCommercial-NoDerivs 3.0 Chile
dc.subjectCompressing Text
dc.titleCompressing Distributed Text in Parallel with (s; c)-Dense Codes
dc.typeArtículo de revista


Este ítem pertenece a la siguiente institución