C++17 implementation of memory-efficient dynamic tries
☆58Feb 15, 2022Updated 4 years ago
Alternatives and similar repositories for poplar-trie
Users that are interested in poplar-trie are comparing it to the libraries listed below
Sorting:
- Compact Tree Representation☆16Mar 16, 2017Updated 8 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆36Jan 8, 2023Updated 3 years ago
- COllapsed and COmpressed trie: a data-aware compressed string dictionary☆36Feb 15, 2025Updated last year
- 🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.☆15Jun 28, 2022Updated 3 years ago
- A blend of the compact and sparse hash table implementations.☆15Aug 20, 2021Updated 4 years ago
- String Visualizer☆12Dec 18, 2025Updated 2 months ago
- Clustered Elias-Fano inverted indexes.☆15Jun 4, 2018Updated 7 years ago
- Bicriteria Data Compressor☆14Dec 9, 2017Updated 8 years ago
- A C++ library implementing fast language models estimation using the 1-Sort algorithm.☆17May 18, 2023Updated 2 years ago
- Universe-sliced indexes in C++.☆18Jan 8, 2023Updated 3 years ago
- Succinct Data Structure Library 3.0☆103Dec 15, 2025Updated 2 months ago
- TU DOrtmund lossless COMPression framework☆19Sep 7, 2024Updated last year
- C++ Library implementing Compressed String Dictionaries☆46Apr 25, 2022Updated 3 years ago
- AirIndex: Versatile Index Tuning Through Data and Storage☆10Dec 18, 2024Updated last year
- String map implementation through Fast Succinct Trie☆23Jul 9, 2021Updated 4 years ago
- A library of inverted index data structures☆151Dec 15, 2022Updated 3 years ago
- Emerald☆10Feb 19, 2017Updated 9 years ago
- ☆12Dec 18, 2018Updated 7 years ago
- Compressed double-array tries for static string dictionaries☆11May 9, 2019Updated 6 years ago
- Cloud Native Distributed Nearest Neighbour Search☆15Jun 9, 2020Updated 5 years ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆31Jan 8, 2023Updated 3 years ago
- Dynamic succinct/compressed data structures☆117Dec 17, 2025Updated 2 months ago
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆34Apr 7, 2025Updated 11 months ago
- CodeMirror bindings for ShareDB.☆11Feb 24, 2019Updated 7 years ago
- ⚙️🛠️ Essential C++ utilities.☆14Updated this week
- This is the code for our self-designing range filter as described in our SIGMOD'22 paper of the same name.☆14Feb 23, 2023Updated 3 years ago
- This is the official repo for the paper "A General Framework for Dynamic Succinct and Compressed Data Structures."☆13Oct 26, 2016Updated 9 years ago
- Wavelet tree based on a fixed block boosting technique☆16May 18, 2021Updated 4 years ago
- Some near drop in stl compatible hash tables that are a lot more space efficient than any other options.☆23Sep 16, 2022Updated 3 years ago
- Cache-friendly, Parallel, and Samplesort-based Constructor for Suffix Arrays and LCP Arrays☆17Jun 23, 2025Updated 8 months ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆46Sep 4, 2024Updated last year
- Use CMake's ExternalProject module to build OSPRay☆16Jun 2, 2022Updated 3 years ago
- vector illustrations of BWT based searching on small strings☆16Apr 29, 2019Updated 6 years ago
- A parallelized implementation of optimized MSD radix sort for strings☆27Oct 11, 2018Updated 7 years ago
- Space efficient (graph) algorithms☆18Sep 10, 2020Updated 5 years ago
- C++ implementation of a fast and memory efficient HAT-trie☆859Nov 11, 2025Updated 3 months ago
- Paper Collection for Stringologists☆17Feb 14, 2026Updated 3 weeks ago
- ☆19Sep 29, 2020Updated 5 years ago
- A Japanese law parser☆25Jan 25, 2024Updated 2 years ago