migumar2 / libCSDLinks
C++ Library implementing Compressed String Dictionaries
☆46Updated 3 years ago
Alternatives and similar repositories for libCSD
Users that are interested in libCSD are comparing it to the libraries listed below
Sorting:
- High-performance dictionary coding☆106Updated 8 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆57Updated 2 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆55Updated last year
- Fast differential coding functions (using SIMD instructions)☆54Updated 7 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- Suite of universal indexes for Highly Repetitive Document Collections☆20Updated 5 years ago
- Universe-sliced indexes in C++.☆18Updated 2 years ago
- Fast decoder for VByte-compressed integers☆125Updated last year
- Compact Data Structures Library☆101Updated 3 years ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- C++17 implementation of memory-efficient dynamic tries☆58Updated 3 years ago
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Updated 3 years ago
- COllapsed and COmpressed trie: a data-aware compressed string dictionary☆35Updated 7 months ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆30Updated 2 years ago
- Succinct data structures in C/C++☆88Updated 11 months ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆64Updated last year
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 years ago
- String map implementation through Fast Succinct Trie☆21Updated 4 years ago
- Learned Monotone Minimal Perfect Hashing☆28Updated 6 months ago
- A library of inverted index data structures☆150Updated 2 years ago
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆31Updated 5 months ago
- Fast compressed trie dictionary library☆70Updated last year
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆15Updated 7 years ago
- A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)☆87Updated 4 years ago
- Compact Tree Representation☆16Updated 8 years ago
- An encoder/decoder collection for a sequence of integers☆32Updated 12 years ago
- A collection of succinct data structures☆209Updated last year
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆46Updated last year
- A fast implementation for varbyte 32bit/64bit integer compression☆119Updated 8 years ago
- C library to compute the Hamming weight of arrays☆48Updated 6 years ago