mlsanityData to 14 Oct 2026

SFVInt: Simple, Fast and Generic Variable-Length Integer Decoding using Bit Manipulation Instructions

arXiv 2403.06898 ↗First posted 11 Mar 2024cs.DB cs.DCcited by 1

Not on the map. Why?

Abstract (arXiv)

The ubiquity of variable-length integers in data storage and communication necessitates efficient decoding techniques. In this paper, we present SFVInt, a simple and fast approach to decode the prevalent Little Endian Base-128 (LEB128) varints. Our approach effectively utilizes the Bit Manipulation Instruction Set 2 (BMI2) in modern Intel and AMD processors, achieving significant performance improvement while maintaining simplicity and avoiding overengineering. SFVInt, with its generic design, effectively processes both 32-bit and 64-bit unsigned integers using a unified code template, marking a significant leap forward in varint decoding efficiency. We thoroughly evaluate SFVInt's performance across various datasets and scenarios, demonstrating that it achieves up to a 2x increase in decoding speed when compared to varint decoding methods used in established frameworks like Facebook Folly and Google Protobuf.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). First posted on arXiv 11 Mar 2024.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2024: 1.

1 paper.