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
- Bicriteria Data Compressor☆15Dec 9, 2017Updated 8 years ago
- COllapsed and COmpressed trie: a data-aware compressed string dictionary☆36Apr 9, 2026Updated 2 months ago
- A new lossless data compression algorithm☆12Nov 19, 2025Updated 7 months ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆15Aug 7, 2018Updated 7 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.
- String Visualizer☆12Dec 18, 2025Updated 6 months 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 last year
- Static Huffman coding☆10Apr 3, 2017Updated 9 years ago
- Implementation of eBWT using Prefix-free parse (PFP)☆14Jul 14, 2025Updated 11 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
- HOT - Height Optimized Trie☆158Mar 26, 2018Updated 8 years ago
- 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.
- This is the official repo for the paper "A General Framework for Dynamic Succinct and Compressed Data Structures."☆13Oct 26, 2016Updated 9 years ago
- 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++.☆56Sep 24, 2023Updated 2 years ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆31Jan 8, 2023Updated 3 years ago
- Fast compressed trie dictionary library☆73Sep 20, 2024Updated last year
- String map implementation through Fast Succinct Trie☆23Jul 9, 2021Updated 4 years ago
- Deploy to Railway using AI coding agents - Free Credits Offer • AdUse Claude Code, Codex, OpenCode, and more. Autonomous software development now has the infrastructure to match with Railway.
- Fast, Cache-Efficient, and Scalable Queries on Pangenomes☆41Mar 9, 2026Updated 3 months ago
- Dynamic succinct/compressed data structures☆118Dec 17, 2025Updated 6 months ago
- Compressed double-array tries for static string dictionaries☆12May 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 tool for visualizing the internal structures of morphological analyzer Sudachi☆18Jun 9, 2022Updated 4 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
- 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
- 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.
- A Benchmark of Minimal Perfect Hash Function Algorithms.☆38Dec 20, 2022Updated 3 years ago
- Cloud Native Distributed Nearest Neighbour Search☆15Jun 9, 2020Updated 6 years ago
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆35Apr 7, 2025Updated last year
- A self-contained, header-only, implementation of memory-mapped files in C++ for fast integration into larger projects.☆38Aug 22, 2024Updated last year
- Paper Collection for Stringologists☆17Mar 29, 2026Updated 2 months ago
- A cheatsheet for most common Stringology tasks☆14Apr 14, 2021Updated 5 years ago
- Implementation of a Backpack Quotient Filter☆13May 6, 2026Updated last month