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☆54Updated 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
- 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
- Feed-forward Bloom filters☆52Updated 14 years ago
- ☆26Updated 8 years ago
- Compact Data Structures Library☆128Updated 10 years ago
- Implementation of the JSON semi-index described in the paper "Semi-Indexing Semi-Structured Data in Tiny Space"☆58Updated 12 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆15Updated 7 years ago
- A collection of succinct data structures☆207Updated last year
- bit & sketches data structures☆60Updated 6 years ago
- Compact Data Structures Library☆101Updated 3 years ago
- finding set bits in large bitmaps☆15Updated 9 years ago
- Experiments with array layouts for comparison-based searching☆84Updated last year
- High-performance dictionary coding☆104Updated 8 years ago
- SIMD recipes, for various platforms (collection of code snippets)☆49Updated 4 years ago
- Lock-free multithreaded memory allocation☆107Updated 8 years ago
- C++11 library for fast fuzzy searching☆14Updated 10 years ago
- A compact implementation of Dr. Askitis HatTrie☆80Updated 11 years ago
- A small DFA for under 16 states☆51Updated 7 years ago
- Suite of universal indexes for Highly Repetitive Document Collections☆20Updated 5 years ago
- Succinct data structures in C/C++☆88Updated 10 months ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆64Updated last year
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆30Updated 2 years ago
- Bloom filter alternative (C++)☆18Updated 6 years ago
- Counting the collisions with perl hash tables per function☆12Updated 6 years ago
- Benchmark showing the we can randomly hash strings very quickly with good universality☆137Updated 6 months ago
- Fast differential coding functions (using SIMD instructions)☆54Updated 7 years ago
- qp tries and crit-bit tries☆121Updated 3 years ago
- nkvdb - is a numeric time-series database.☆35Updated 8 years ago