Add to ORKGThis Thesis presents compressed succinct data structures with the aim of applying the Elias-Fano encoding to dynamic monotone integer sequences. The presented material shows we are loosing a negligible factor in space and very little in time with respect to an equivalent, statically Elias-Fano compressed, sequence
In this paper we present DYNAMIC, an open-source C++ library implementing dynamic compressed data st...
AbstractOperations rank and select over a sequence of symbols have many applications to the design o...
State-of-the-art encoders for inverted indexes compress each posting list individually. Encoding clu...
We show that it is possible to store a dynamic ordered set S of n integers drawn from a bounded univ...
Abstract In this thesis, I address the well-known problem of designing, implementing and experimenti...
Statistical coding techniques have been used for a long time in lossless data compression, using met...
We show that it is possible to store a dynamic ordered set S(n,u) of n integers drawn from a bounded...
Statistical coding techniques have been used for a long time in lossless data compression, using met...
Statistical coding techniques have been used for a long time in lossless data compression, using met...
The Elias-Fano representation of monotone sequences has been recently applied to the compression of ...
We study algorithms for efficient compression and decompression of a sequence of integers on modern ...
Adaptive coding techniques have been increasingly used in lossless data compression. They are suitab...
This thesis focuses on the design of succinct and compressed data structures for collections of stri...
In this paper, we propose a greedy technique for adaptive Fano coding, which is suitable for a wide ...
In this paper we present DYNAMIC, an open-source C++ library implementing dynamic compressed data st...
In this paper we present DYNAMIC, an open-source C++ library implementing dynamic compressed data st...
AbstractOperations rank and select over a sequence of symbols have many applications to the design o...
State-of-the-art encoders for inverted indexes compress each posting list individually. Encoding clu...
We show that it is possible to store a dynamic ordered set S of n integers drawn from a bounded univ...
Abstract In this thesis, I address the well-known problem of designing, implementing and experimenti...
Statistical coding techniques have been used for a long time in lossless data compression, using met...
We show that it is possible to store a dynamic ordered set S(n,u) of n integers drawn from a bounded...
Statistical coding techniques have been used for a long time in lossless data compression, using met...
Statistical coding techniques have been used for a long time in lossless data compression, using met...
The Elias-Fano representation of monotone sequences has been recently applied to the compression of ...
We study algorithms for efficient compression and decompression of a sequence of integers on modern ...
Adaptive coding techniques have been increasingly used in lossless data compression. They are suitab...
This thesis focuses on the design of succinct and compressed data structures for collections of stri...
In this paper, we propose a greedy technique for adaptive Fano coding, which is suitable for a wide ...
In this paper we present DYNAMIC, an open-source C++ library implementing dynamic compressed data st...
In this paper we present DYNAMIC, an open-source C++ library implementing dynamic compressed data st...
AbstractOperations rank and select over a sequence of symbols have many applications to the design o...
State-of-the-art encoders for inverted indexes compress each posting list individually. Encoding clu...