kampersanda / poplar-trieView external linksLinks
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 blend of the compact and sparse hash table implementations.☆15Aug 20, 2021Updated 4 years ago
- 🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.☆15Jun 28, 2022Updated 3 years ago
- String Visualizer☆12Dec 18, 2025Updated last month
- Bicriteria Data Compressor☆14Dec 9, 2017Updated 8 years ago
- Clustered Elias-Fano inverted indexes.☆15Jun 4, 2018Updated 7 years ago
- Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.☆14May 11, 2018Updated 7 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆15Aug 7, 2018Updated 7 years ago
- TU DOrtmund lossless COMPression framework☆19Sep 7, 2024Updated last year
- Dynamic Score-Decomposed Tries which more efficiently solve the prefix autocomplete problem☆28Mar 30, 2025Updated 10 months ago
- A C++ library providing fast language model queries in compressed space.☆132Feb 25, 2023Updated 2 years ago
- Succinct Data Structure Library 3.0☆102Dec 15, 2025Updated 2 months ago
- Fast compressed trie dictionary library☆71Sep 20, 2024Updated last year
- AirIndex: Versatile Index Tuning Through Data and Storage☆10Dec 18, 2024Updated last year
- Implementation of a Backpack Quotient Filter☆13Jul 7, 2025Updated 7 months ago
- C++ Library implementing Compressed String Dictionaries☆46Apr 25, 2022Updated 3 years ago
- Static Huffman coding☆10Apr 3, 2017Updated 8 years ago
- Implementation of eBWT using Prefix-free parse (PFP)☆14Jul 14, 2025Updated 7 months ago
- String map implementation through Fast Succinct Trie☆21Jul 9, 2021Updated 4 years ago
- ☆12Dec 18, 2018Updated 7 years ago
- A four-dimensional Analysis of Partitioned Approximate Filters☆11Aug 6, 2025Updated 6 months ago
- Emerald☆10Feb 19, 2017Updated 8 years ago
- Compressed double-array tries for static string dictionaries☆11May 9, 2019Updated 6 years ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆31Jan 8, 2023Updated 3 years ago
- HOT - Height Optimized Trie☆158Mar 26, 2018Updated 7 years ago
- Dynamic succinct/compressed data structures☆115Dec 17, 2025Updated last month
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆34Apr 7, 2025Updated 10 months ago
- Essential C++ utilities.☆14Nov 13, 2025Updated 3 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
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Nov 10, 2021Updated 4 years ago
- CodeMirror bindings for ShareDB.☆11Feb 24, 2019Updated 6 years ago
- Collection of succinct data structures in Rust☆103Aug 1, 2025Updated 6 months ago
- A Benchmark of Minimal Perfect Hash Function Algorithms.☆38Dec 20, 2022Updated 3 years ago
- A tool for visualizing the internal structures of morphological analyzer Sudachi☆18Jun 9, 2022Updated 3 years ago
- Wavelet tree based on a fixed block boosting technique☆16May 18, 2021Updated 4 years ago
- A cheatsheet for most common Stringology tasks☆14Apr 14, 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