ot / path_decomposed_triesLinks
Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
☆57Updated 2 years ago
Alternatives and similar repositories for path_decomposed_tries
Users that are interested in path_decomposed_tries are comparing it to the libraries listed below
Sorting:
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆55Updated last year
- Fast implementations of the scancount algorithm: C++ header-only library☆27Updated 5 years ago
- A fast implementation for varbyte 32bit/64bit integer compression☆119Updated 8 years ago
- Compact Data Structures Library☆101Updated 3 years ago
- Feed-forward Bloom filters☆53Updated 14 years ago
- ☆27Updated 8 years ago
- finding set bits in large bitmaps☆15Updated 9 years ago
- A collection of succinct data structures☆209Updated last year
- Highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of n elements supporting access in time O(…☆50Updated last year
- Compact Data Structures Library☆128Updated 11 years ago
- Universe-sliced indexes in C++.☆18Updated 2 years ago
- A compact implementation of Dr. Askitis HatTrie☆80Updated 11 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆15Updated 7 years ago
- 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
- High-performance dictionary coding☆106Updated 8 years ago
- Suite of universal indexes for Highly Repetitive Document Collections☆20Updated 5 years ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆30Updated 2 years ago
- C++ Library implementing Compressed String Dictionaries☆46Updated 3 years ago
- Lock-free multithreaded memory allocation