migumar2 / libCSD
C++ Library implementing Compressed String Dictionaries
☆45Updated 2 years ago
Related projects ⓘ
Alternatives and complementary repositories for libCSD
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆55Updated last year
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated last year
- Suite of universal indexes for Highly Repetitive Document Collections☆20Updated 4 years ago
- Compact Data Structures Library☆98Updated 2 years ago
- Compact Tree Representation☆16Updated 7 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆52Updated 10 months 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
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆43Updated 2 months ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆61Updated 5 months ago
- High-performance dictionary coding☆103Updated 7 years ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆28Updated last year
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆51Updated 7 years ago
- Universe-sliced indexes in C++.☆17Updated last year
- A fast implementation for varbyte 32bit/64bit integer compression☆115Updated 7 years ago
- An encoder/decoder collection for a sequence of integers☆32Updated 11 years ago
- Clustered Elias-Fano inverted indexes.☆14Updated 6 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆15Updated 6 years ago
- Fast differential coding functions (using SIMD instructions)☆49Updated 6 years ago
- Succinct data structures in C/C++☆82Updated last month
- C++17 implementation of memory-efficient dynamic tries☆57Updated 2 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆27Updated 3 years ago
- testbed for different SIMD implementations for set intersection and set union☆40Updated 4 years ago
- Code used for the experiments in the paper "Partitioned Elias-Fano Indexes"☆37Updated 9 years ago
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Updated 3 years ago
- Fast implementations of the scancount algorithm: C++ header-only library☆25Updated 5 years ago
- Fast decoder for VByte-compressed integers☆117Updated 5 months ago
- Compact Data Structures Library☆124Updated 10 years ago
- Dynamic succinct/compressed data structures☆111Updated 5 months ago
- Highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of n elements supporting access in time O(…☆49Updated 6 months ago
- Linear vs binary search benchmark☆41Updated 4 years ago