migumar2 / libCSD
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
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆56Updated 2 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆54Updated last year
- Compact Tree Representation☆16Updated 8 years ago
- Compact Data Structures Library☆98Updated 2 years ago
- C++17 implementation of memory-efficient dynamic tries☆58Updated 3 years ago
- An encoder/decoder collection for a sequence of integers☆32Updated 12 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆29Updated 2 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 years ago
- High-performance dictionary coding☆104Updated 8 years ago
- Suite of universal indexes for Highly Repetitive Document Collections☆20Updated 4 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆29Updated 3 years ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- Fast differential coding functions (using SIMD instructions)☆52Updated 7 years ago
- Universe-sliced indexes in C++.☆18Updated 2 years ago
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Updated 3 years ago
- Succinct data structures in C/C++☆87Updated 6 months ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆43Updated 8 months ago
- C++ Implementation of Zip Trees☆14Updated 2 years ago
- A fast implementation for varbyte 32bit/64bit integer compression☆117Updated 8 years ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆63Updated 11 months ago
- Clustered Elias-Fano inverted indexes.☆15Updated 6 years ago
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆30Updated 3 weeks ago
- Highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of n elements supporting access in time O(…☆50Updated last year
- 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 …☆26Updated 3 years ago
- Succinct C++☆24Updated 4 years ago
- Compact Data Structures Library☆124Updated 10 years ago
- String map implementation through Fast Succinct Trie☆21Updated 3 years ago
- High-speed Bloom filters and taffy filters for C, C++, and Java☆35Updated last year
- GPU-Accelerated Faster Decoding of Integer Lists☆13Updated 5 years ago