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:
- 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☆36Apr 9, 2026Updated last month
- A new lossless data compression algorithm☆12Nov 19, 2025Updated 6 months ago
- Deploy on Railway without the complexity - Free Credits Offer • AdConnect your repo and Railway handles the rest with instant previews. Quickly provision container image services, databases, and storage volumes.
- 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 3 years ago
- Succinct Data Structure Library 3.0☆106Apr 27, 2026Updated last month
- String Visualizer☆12Dec 18, 2025Updated 5 months ago
- Collection of succinct data structures in Rust☆104Mar 4, 2026Updated 2 months ago
- Universe-sliced indexes in C++.☆18Jan 8, 2023Updated 3 years ago
- TU DOrtmund lossless COMPression framework☆19Sep 7, 2024Updated last year
- 🌳 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 last year
- Wordpress hosting with auto-scaling - Free Trial Offer • AdFully Managed hosting for WordPress and WooCommerce businesses that need reliable, auto-scalable performance. Cloudways SafeUpdates now available.
- A multi-language segmenter using high-order CRF.☆17Feb 27, 2020Updated 6 years ago
- Static Huffman coding☆10Apr 3, 2017Updated 9 years ago
- Clustered Elias-Fano inverted indexes.☆15Jun 4, 2018Updated 7 years ago
- Implementation of eBWT using Prefix-free parse (PFP)☆14Jul 14, 2025Updated 10 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☆18Jun 23, 2025Updated 11 months ago
- HOT - Height Optimized Trie☆158Mar 26, 2018Updated 8 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
- 1-Click AI Models by DigitalOcean Gradient • AdDeploy popular AI models on DigitalOcean Gradient GPU virtual machines with just a single click. Zero configuration with optimized deployments.
- Linear vs binary search benchmark☆42Dec 12, 2019Updated 6 years ago
- ProphAsm – a rapid computation of simplitigs directly from k-mer sets☆25Feb 17, 2023Updated 3 years ago
- CodeMirror bindings for ShareDB.☆11Feb 24, 2019Updated 7 years ago
- vector illustrations of BWT based searching on small strings☆16Apr 29, 2019Updated 7 years ago
- Efficient and effective query auto-completion in C++.☆55Sep 24, 2023Updated 2 years ago
- ⚙️🛠️ Essential C++ utilities.☆14Mar 9, 2026Updated 2 months ago
- Fast compressed trie dictionary library☆72Sep 20, 2024Updated last year
- C++ Library implementing Compressed String Dictionaries☆47Apr 25, 2022Updated 4 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆46Sep 4, 2024Updated last year
- 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.
- Compressed double-array tries for static string dictionaries☆11May 9, 2019Updated 7 years ago
- Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.☆14May 11, 2018Updated 8 years ago
- 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
- A four-dimensional Analysis of Partitioned Approximate Filters☆11Aug 6, 2025Updated 9 months 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 6 years ago