By Topic

Compressing distributed text in parallel with (s, c)-dense codes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Bonacic, C. ; Departamento de Ciencia de la Computacion, Univ. de Chile, Chile ; Farina, A. ; Marin, M. ; Brisaboa, N.R.

Systems 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.

Published in:

Computer Science Society, 2004. SCCC 2004. 24th International Conference of the Chilean

Date of Conference:

11-12 Nov. 2004