• Computer Science
  • Published in ArXiv 2015

Vectorized VByte Decoding

@article{Plaisance2015VectorizedVD,
  title={Vectorized VByte Decoding},
  author={Jeff Plaisance and Nathan Kurz and Daniel Lemire},
  journal={ArXiv},
  year={2015},
  volume={abs/1503.07387}
}
We consider the ubiquitous technique of VByte compression, which represents each integer as a variable length sequence of bytes. The low 7 bits of each byte encode a portion of the integer, and the high bit of each byte is reserved as a continuation flag. This flag is set to 1 for all bytes except the last, and the decoding of each integer is complete when a byte with a high bit of 0 is encountered. VByte decoding can be a performance bottleneck especially when the unpredictable lengths of the… CONTINUE READING

Figures, Tables, and Topics from this paper.

Explore Further: Topics Discussed in This Paper

Citations

Publications citing this paper.
SHOWING 1-10 OF 19 CITATIONS

Variable-Byte Encoding is Now Space-Efficient Too

VIEW 6 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

On Optimally Partitioning Variable-Byte Codes

VIEW 3 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

On Slicing Sorted Integer Sequences

VIEW 6 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Techniques for Inverted Index Compression

VIEW 4 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

References

Publications referenced by this paper.