The accessing and processing of textual information (i.e. the storing and querying of a set of strings) is especially important for many current applications (e.g. information retrieval and social networks), especially when working in the fields of Big Data or IoT, which require the handling of very large string dictionaries. Typical data structures for textual indexing are Hash Tables and some variants of Tries such as the Double Trie (DT). In this paper, we propose an extension of the DT that we have called MergedTrie. It improves the DT compression by merging both Tries into a single and by segmenting the indexed term into two fixed length parts in order to balance the new Trie. Thus, a higher overlapping of both prefixes and suffixes is...
This thesis deals with space-efficient algorithms to compress and index texts. The aim of compressio...
The rise of repetitive datasets has lately generated a lot of interest in compressed self-indexes ba...
An indexed sequence of strings is a data structure for storing a string sequence that supports rando...
The accessing and processing of textual information (i.e. the storing and querying of a set of strin...
This thesis presents three trie organizations for various binary tries. The new trie structures have...
In this thesis, we will illustrate a two-level approach to compress and index string dictionaries, w...
We report on a new and improved version of high-order entropy-compressed suffix arrays, which has th...
The need to store and query a set of strings { a string dictionary { arises in many kinds of applica...
We design two compressed data structures for the full-text indexing problem that support efficient s...
Tries are popular data structures for storing a set of strings, where common prefixes are represente...
AbstractThis article considers several strategies to implement efficiently full indexes on raw textu...
The need to store and query a set of strings – a string dictionary – arises in many kinds of applica...
Artículo de publicación ISIThe need to store and query a set of strings - a string dictionary - aris...
Abstract. We present a technique to build an index based on sux arrays for compressed texts. We also...
In this paper we design two compressed data structures for the full-text indexing problem. These da...
This thesis deals with space-efficient algorithms to compress and index texts. The aim of compressio...
The rise of repetitive datasets has lately generated a lot of interest in compressed self-indexes ba...
An indexed sequence of strings is a data structure for storing a string sequence that supports rando...
The accessing and processing of textual information (i.e. the storing and querying of a set of strin...
This thesis presents three trie organizations for various binary tries. The new trie structures have...
In this thesis, we will illustrate a two-level approach to compress and index string dictionaries, w...
We report on a new and improved version of high-order entropy-compressed suffix arrays, which has th...
The need to store and query a set of strings { a string dictionary { arises in many kinds of applica...
We design two compressed data structures for the full-text indexing problem that support efficient s...
Tries are popular data structures for storing a set of strings, where common prefixes are represente...
AbstractThis article considers several strategies to implement efficiently full indexes on raw textu...
The need to store and query a set of strings – a string dictionary – arises in many kinds of applica...
Artículo de publicación ISIThe need to store and query a set of strings - a string dictionary - aris...
Abstract. We present a technique to build an index based on sux arrays for compressed texts. We also...
In this paper we design two compressed data structures for the full-text indexing problem. These da...
This thesis deals with space-efficient algorithms to compress and index texts. The aim of compressio...
The rise of repetitive datasets has lately generated a lot of interest in compressed self-indexes ba...
An indexed sequence of strings is a data structure for storing a string sequence that supports rando...