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

Uploads

Papers by Diego Arroyuelo

Research paper thumbnail of Succinct Dynamic Cardinal Trees

Algorithmica, 2015

Bookmarks Related papers MentionsView impact

Research paper thumbnail of LZ78 Compression in Low Main Memory Space

String Processing and Information Retrieval

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Engineering Practical Lempel-Ziv Tries

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.

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Adaptive Succinctness

String Processing and Information Retrieval

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Worst-Case Optimal Graph Joins in Almost No Space

Proceedings of the 2021 International Conference on Management of Data

Bookmarks Related papers MentionsView impact

Research paper thumbnail of To index or not to index: Time-space trade-offs for positional ranking functions in search engines

Information Systems

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Hybrid compression of inverted lists for reordered document collections

Information Processing & Management

Bookmarks Related papers MentionsView impact

Research paper thumbnail of K.: Reducing the space requirement of LZ-Index

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Fully Dynamic and Memory-Adaptative Spatial Approximation Trees

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Smaller and Faster Lempel-Ziv Indices

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Succinct Trees in Practice

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

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Untangled monotonic chains and adaptive range search

Theoretical Computer Science, 2011

Bookmarks Related papers MentionsView impact

Research paper thumbnail of To index or not to index

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

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Document identifier reassignment and run-length-compressed inverted indexes for improved search performance

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

ABSTRACT

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Compressed Self-indices Supporting Conjunctive Queries on Document Collections

Lecture Notes in Computer Science, 2010

Bookmarks Related papers MentionsView impact

Research paper thumbnail of A Lempel-Ziv Text Index on Secondary Storage

Lecture Notes in Computer Science, 2007

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Space-Efficient Construction of LZ-Index

Lecture Notes in Computer Science, 2005

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Reducing the Space Requirement of LZ-Index

Lecture Notes in Computer Science, 2006

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Distributed text search using suffix arrays

Parallel Computing, 2014

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Memory-Adaptative Dynamic Spatial Approximation Trees

Lecture Notes in Computer Science, 2003

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Succinct Dynamic Cardinal Trees

Algorithmica, 2015

Bookmarks Related papers MentionsView impact

Research paper thumbnail of LZ78 Compression in Low Main Memory Space

String Processing and Information Retrieval

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Engineering Practical Lempel-Ziv Tries

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.

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Adaptive Succinctness

String Processing and Information Retrieval

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Worst-Case Optimal Graph Joins in Almost No Space

Proceedings of the 2021 International Conference on Management of Data

Bookmarks Related papers MentionsView impact

Research paper thumbnail of To index or not to index: Time-space trade-offs for positional ranking functions in search engines

Information Systems

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Hybrid compression of inverted lists for reordered document collections

Information Processing & Management

Bookmarks Related papers MentionsView impact

Research paper thumbnail of K.: Reducing the space requirement of LZ-Index

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Fully Dynamic and Memory-Adaptative Spatial Approximation Trees

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Smaller and Faster Lempel-Ziv Indices

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Succinct Trees in Practice

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

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Untangled monotonic chains and adaptive range search

Theoretical Computer Science, 2011

Bookmarks Related papers MentionsView impact

Research paper thumbnail of To index or not to index

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

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Document identifier reassignment and run-length-compressed inverted indexes for improved search performance

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

ABSTRACT

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Compressed Self-indices Supporting Conjunctive Queries on Document Collections

Lecture Notes in Computer Science, 2010

Bookmarks Related papers MentionsView impact

Research paper thumbnail of A Lempel-Ziv Text Index on Secondary Storage

Lecture Notes in Computer Science, 2007

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Space-Efficient Construction of LZ-Index

Lecture Notes in Computer Science, 2005

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Reducing the Space Requirement of LZ-Index

Lecture Notes in Computer Science, 2006

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Distributed text search using suffix arrays

Parallel Computing, 2014

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Memory-Adaptative Dynamic Spatial Approximation Trees

Lecture Notes in Computer Science, 2003

Bookmarks Related papers MentionsView impact