kampersanda / fast_succinct_trieView external linksLinks
String map implementation through Fast Succinct Trie
☆21Jul 9, 2021Updated 4 years ago
Alternatives and similar repositories for fast_succinct_trie
Users that are interested in fast_succinct_trie are comparing it to the libraries listed below
Sorting:
- Fast compressed trie dictionary library☆71Sep 20, 2024Updated last year
- COllapsed and COmpressed trie: a data-aware compressed string dictionary☆36Feb 15, 2025Updated last year
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆36Jan 8, 2023Updated 3 years ago
- ☆27Mar 23, 2017Updated 8 years ago
- ☆20Jan 8, 2026Updated last month
- A C++ library to benchmark inverted indexes.☆21Aug 4, 2020Updated 5 years ago
- A self-contained, header-only, implementation of memory-mapped files in C++ for fast integration into larger projects.☆26Aug 22, 2024Updated last year
- Implementation of a Backpack Quotient Filter☆13Jul 7, 2025Updated 7 months ago
- Fast User Level LOCK library☆27Oct 6, 2025Updated 4 months ago
- This is the code for our self-designing range filter as described in our SIGMOD'22 paper of the same name.☆14Feb 23, 2023Updated 2 years ago
- Benchmark of four minimal perfect hash libraries (phf, emphf, CMPH, Sux4J)☆14Apr 6, 2017Updated 8 years ago
- A Benchmark of Minimal Perfect Hash Function Algorithms.☆38Dec 20, 2022Updated 3 years ago
- Official repository of the ACM SIGIR 2019 paper: "Fast Approximate Filtering of Search Results Sorted by Attribute" by Franco Maria Nardi…☆14Nov 7, 2019Updated 6 years ago
- A (Minimal) Perfect Hash Function based on irregular cuckoo hashing, retrieval, and overloading.☆21Sep 30, 2025Updated 4 months ago
- Succinct data structures in C/C++☆93Oct 7, 2024Updated last year
- Packed and Compressed Hash Tables☆15Apr 7, 2025Updated 10 months ago
- Compact Tree Representation☆16Mar 16, 2017Updated 8 years ago
- High-speed Bloom filters and taffy filters for C, C++, and Java☆35Aug 9, 2023Updated 2 years ago
- ☆34Feb 1, 2026Updated 2 weeks ago
- Lightweight Msgpack Encoder☆15Feb 19, 2017Updated 8 years ago
- Sort function at 5 to 7 times faster than std :: sort☆15May 4, 2019Updated 6 years ago
- ASIO Cooperative Task for await-based coroutine☆16Sep 8, 2018Updated 7 years ago
- HOT - Height Optimized Trie☆158Mar 26, 2018Updated 7 years ago
- C++ implementation of Concise and WAH compressed bitsets☆20Mar 31, 2017Updated 8 years ago
- A sort wrapper enabling both use of random-access sorting on non-random access containers, and increased performance for the sorting of l…☆20Jul 11, 2025Updated 7 months ago
- C++ Library implementing Compressed String Dictionaries☆46Apr 25, 2022Updated 3 years ago
- A Boost.Asio-based driver for PostgreSQL☆19Apr 13, 2020Updated 5 years ago
- Bumped Ribbon Retrieval and Approximate Membership Query☆51Jun 16, 2025Updated 7 months ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆55Jan 3, 2024Updated 2 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆58Jan 27, 2023Updated 3 years ago
- C library to pack and unpack short arrays of integers as fast as possible☆93Mar 11, 2023Updated 2 years ago
- Compile-time single-header hash-map written in C++ 17☆21Feb 5, 2026Updated last week
- Fast integer to string and string to integer conversion functions☆24Sep 25, 2023Updated 2 years ago
- C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference☆54Feb 19, 2024Updated last year
- Experiments with array layouts for comparison-based searching☆86Jan 5, 2024Updated 2 years ago
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆48Sep 12, 2022Updated 3 years ago
- Efficient and effective query auto-completion in C++.☆57Sep 24, 2023Updated 2 years ago
- An intrusive lock-free multiple-producer, single-consumer queue in C++☆52Sep 19, 2016Updated 9 years ago
- C++17 implementation of memory-efficient dynamic tries☆58Feb 15, 2022Updated 4 years ago