Diego Arroyuelo | UTFSM - Academia.edu (original) (raw)

Uploads

Papers by Diego Arroyuelo

String Processing and Information Retrieval

ACM Journal of Experimental Algorithmics

The Lempel-Ziv 78 ( LZ78 ) and Lempel-Ziv-Welch ( LZW ) text factorizations are popular, not only... more The Lempel-Ziv 78 ( LZ78 ) and Lempel-Ziv-Welch ( LZW ) text factorizations are popular, not only for bare compression but also for building compressed data structures on top of them. Their regular factor structure makes them computable within space bounded by the compressed output size. In this article, we carry out the first thorough study of low-memory LZ78 and LZW text factorization algorithms, introducing more efficient alternatives to the classical methods, as well as new techniques that can run within less memory space than the necessary to hold the compressed file. Our results build on hash-based representations of tries that may have independent interest.

String Processing and Information Retrieval

Proceedings of the 2021 International Conference on Management of Data

Information Processing & Management

2010 Proceedings of the Twelfth Workshop on Algorithm Engineering and Experiments (ALENEX), 2010

Theoretical Computer Science, 2011

Proceedings of the 35th international ACM SIGIR conference on Research and development in information retrieval - SIGIR '12, 2012

Positional ranking functions, widely used in Web search engines, improve result quality by exploi... more Positional ranking functions, widely used in Web search engines, improve result quality by exploiting the positions of the query terms within documents. However, it is well known that positional indexes demand large amounts of extra space, typically about three times the space of a basic nonpositional index. Textual data, on the other hand, is needed to produce text snippets. In

Proceedings of the 36th international ACM SIGIR conference on Research and development in information retrieval - SIGIR '13, 2013

ABSTRACT