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. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- Compact Tree Representation☆16Mar 16, 2017Updated 9 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆36Jan 8, 2023Updated 3 years ago
- A blend of the compact and sparse hash table implementations.☆15Aug 20, 2021Updated 4 years ago
- Bicriteria Data Compressor☆15Dec 9, 2017Updated 8 years ago
- COllapsed and COmpressed trie: a data-aware compressed string dictionary☆36Mar 18, 2026Updated last week
- Virtual machines for every use case on DigitalOcean • AdGet dependable uptime with 99.99% SLA, simple security tools, and predictable monthly pricing with DigitalOcean's virtual machines, called Droplets.
- A new lossless data compression algorithm☆12Nov 19, 2025Updated 4 months ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆15Aug 7, 2018Updated 7 years ago
- A C++ library implementing fast language models estimation using the 1-Sort algorithm.☆16May 18, 2023Updated 2 years ago
- String Visualizer☆12Dec 18, 2025Updated 3 months ago
- Collection of succinct data structures in Rust☆104Mar 4, 2026Updated 3 weeks ago
- Universe-sliced indexes in C++.☆18Jan 8, 2023Updated 3 years ago
- 🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.☆15Jun 28, 2022Updated 3 years ago
- Dynamic Score-Decomposed Tries which more efficiently solve the prefix autocomplete problem☆28Mar 30, 2025Updated 11 months ago
- Static Huffman coding☆10Apr 3, 2017Updated 8 years ago
- Proton VPN Special Offer - Get 70% off • AdSpecial partner offer. Trusted by over 100 million users worldwide. Tested, Approved and Recommended by Experts.
- Clustered Elias-Fano inverted indexes.☆15Jun 4, 2018Updated 7 years ago
- Implementation of eBWT using Prefix-free parse (PFP)☆14Jul 14, 2025Updated 8 months ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆58Jan 27, 2023Updated 3 years ago
- A C++ library providing fast language model queries in compressed space.☆132Feb 25, 2023Updated 3 years ago
- Cache-friendly, Parallel, and Samplesort-based Constructor for Suffix Arrays and LCP Arrays☆17Jun 23, 2025Updated 9 months ago
- CodeMirror bindings for ShareDB.☆11Feb 24, 2019Updated 7 years ago
- vector illustrations of BWT based searching on small strings☆16Apr 29, 2019Updated 6 years ago
- Efficient and effective query auto-completion in C++.☆56Sep 24, 2023Updated 2 years ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆31Jan 8, 2023Updated 3 years ago
- Managed Kubernetes at scale on DigitalOcean • AdDigitalOcean Kubernetes includes the control plane, bandwidth allowance, container registry, automatic updates, and more for free.
- ⚙️🛠️ Essential C++ utilities.☆14Mar 9, 2026Updated 3 weeks ago
- String map implementation through Fast Succinct Trie☆23Jul 9, 2021Updated 4 years ago
- C++ Library implementing Compressed String Dictionaries☆47Apr 25, 2022Updated 3 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆46Sep 4, 2024Updated last year
- Fast, Cache-Efficient, and Scalable Queries on Pangenomes☆38Mar 9, 2026Updated 3 weeks ago
- Dynamic succinct/compressed data structures☆117Dec 17, 2025Updated 3 months ago
- Compressed double-array tries for static string dictionaries☆11May 9, 2019Updated 6 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
- A tool for visualizing the internal structures of morphological analyzer Sudachi☆18Jun 9, 2022Updated 3 years ago
- NordVPN Special Discount Offer • AdSave on top-rated NordVPN 1 or 2-year plans with secure browsing, privacy protection, and support for for all major platforms.
- A library of inverted index data structures☆150Dec 15, 2022Updated 3 years ago
- Dumps of CRoaring unity builds (for convenience)☆23Jul 20, 2022Updated 3 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
- Suite of universal indexes for Highly Repetitive Document Collections☆24May 14, 2020Updated 5 years ago
- A Benchmark of Minimal Perfect Hash Function Algorithms.☆38Dec 20, 2022Updated 3 years ago
- Automatically exported from code.google.com/p/tx-trie☆29Jun 23, 2015Updated 10 years ago
- A self-contained, header-only, implementation of memory-mapped files in C++ for fast integration into larger projects.☆27Aug 22, 2024Updated last year