vigna / sux
Succinct data structures in C/C++
☆82Updated last month
Related projects ⓘ
Alternatives and complementary repositories for sux
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated last year
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆28Updated last year
- Universe-sliced indexes in C++.☆17Updated last year
- C++17 implementation of memory-efficient dynamic tries☆57Updated 2 years ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆62Updated 5 months ago
- Efficient Prefix-Sum data structures in C++.☆25Updated last year
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆26Updated this week
- Detailed experiments over simdjson for VLDB article (2019) and future work☆22Updated 4 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆52Updated 10 months ago
- testbed for different SIMD implementations for set intersection and set union☆40Updated 4 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆55Updated last year
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆43Updated 2 months ago
- Fast implementations of the scancount algorithm: C++ header-only library☆25Updated 5 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆51Updated 7 years ago
- SIMD recipes, for various platforms (collection of code snippets)☆48Updated 3 years ago
- Fast C header-only library for popcnt, pospopcnt, and set algebraic operations☆45Updated 4 years ago
- C++ Library implementing Compressed String Dictionaries☆46Updated 2 years ago
- C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference☆50Updated 9 months ago
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Updated 3 years ago
- Fast Hash Functions Using AES Intrinsics☆82Updated 5 years ago
- Compact Data Structures Library☆98Updated 2 years ago
- Fast differential coding functions (using SIMD instructions)☆50Updated 6 years ago
- A benchmark for sorting algorithms☆59Updated 3 years ago
- A C++ container-like data structure for storing a vector of bits with fast appending on both sides and fast insertion in the middle, all …☆21Updated 2 years ago
- Compact Data Structures Library☆124Updated 10 years ago
- An encoder/decoder collection for a sequence of integers☆32Updated 11 years ago
- Fast decoder for VByte-compressed integers☆117Updated 6 months ago
- A fast implementation for varbyte 32bit/64bit integer compression☆115Updated 7 years ago
- C++ Implementation of Zip Trees☆13Updated 2 years ago
- Pruning elements in SIMD vectors (i.e., packing left elements)☆60Updated 9 months ago