C++17 implementation of memory-efficient dynamic tries
☆59Feb 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 blend of the compact and sparse hash table implementations.☆15Aug 20, 2021Updated 5 years ago
- 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
- Succinct Data Structure Library 3.0☆112Updated this week
- Bicriteria Data Compressor☆15Dec 9, 2017Updated 8 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.
- C++ Library implementing Compressed String Dictionaries☆47Apr 25, 2022Updated 4 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆15Aug 7, 2018Updated 8 years ago
- TU DOrtmund lossless COMPression framework☆20Sep 7, 2024Updated 2 years ago
- A new lossless data compression algorithm☆12Sep 9, 2026Updated 2 months ago
- Collection of succinct data structures in Rust☆107Oct 25, 2026Updated 3 weeks ago
- A C++ library implementing fast language models estimation using the 1-Sort algorithm.☆16May 18, 2023Updated 3 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆59Jan 27, 2023Updated 3 years ago
- Grafite is a data structure that enables fast range emptiness queries using optimal space and time.☆14Dec 9, 2024Updated last year
- Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.☆14May 11, 2018Updated 8 years ago
- Managed hosting for WordPress and PHP on Cloudways • AdManaged hosting for WordPress, Magento, Laravel, or PHP apps, on multiple cloud providers. Deploy in minutes on Cloudways by DigitalOcean.
- Some near drop in stl compatible hash tables that are a lot more space efficient than any other options.☆24Sep 16, 2022Updated 4 years ago
- Yada is a yet another double-array trie library aiming for fast search and compact data representation.☆50Jun 7, 2026Updated 5 months ago
- A C++ library providing fast language model queries in compressed space.☆131Feb 25, 2023Updated 3 years ago
- Fast compressed trie dictionary library☆73Sep 20, 2024Updated 2 years ago
- Space efficient (graph) algorithms☆17Sep 10, 2020Updated 6 years ago
- Compressed double-array tries for static string dictionaries☆12May 9, 2019Updated 7 years ago
- Static Huffman coding☆10Apr 3, 2017Updated 9 years ago
- String map implementation through Fast Succinct Trie☆24Jul 9, 2021Updated 5 years ago
- Dynamic Score-Decomposed Tries which more efficiently solve the prefix autocomplete problem☆28Mar 30, 2025Updated last year
- 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.
- AirIndex: Versatile Index Tuning Through Data and Storage☆12Dec 18, 2024Updated last year
- Suite of universal indexes for Highly Repetitive Document Collections☆24May 14, 2020Updated 6 years ago
- ☆10Oct 2, 2021Updated 5 years ago
- An Efficient Language Model Using Double-Array Structures☆17Aug 10, 2020Updated 6 years ago
- Efficient and effective query auto-completion in C++.☆56Sep 24, 2023Updated 3 years ago
- 🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.☆15Jun 28, 2022Updated 4 years ago
- HOT - Height Optimized Trie☆159Mar 26, 2018Updated 8 years ago
- Clustered Elias-Fano inverted indexes.☆14Jun 4, 2018Updated 8 years ago
- FOundation of stXXl and thriLL☆14Jan 24, 2024Updated 2 years ago
- GPU virtual machines on DigitalOcean Gradient AI • AdGet to production fast with high-performance AMD and NVIDIA GPUs you can spin up in seconds. The definition of operational simplicity.
- Dynamic succinct/compressed data structures☆120Dec 17, 2025Updated 11 months ago
- A Japanese law parser☆25Jan 25, 2024Updated 2 years ago
- Fast and compact locality-preserving minimal perfect hashing for k-mer sets.☆44Nov 18, 2023Updated 3 years ago
- ⚖️ HAKARI-Bench is a lightweight IR benchmark that rebuilds retrieval tasks as small Nano-sets, making model selection, regression checks…☆34Updated this week
- vector illustrations of BWT based searching on small strings☆16Apr 29, 2019Updated 7 years ago
- ProphAsm – a rapid computation of simplitigs directly from k-mer sets☆25Feb 17, 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 10 years ago
Are these results useful?