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 5 years ago
- COllapsed and COmpressed trie: a data-aware compressed string dictionary☆36Apr 9, 2026Updated 5 months ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆15Aug 7, 2018Updated 8 years ago
- End-to-end encrypted email - Proton Mail • AdSpecial offer: 40% Off Yearly / 80% Off First Month. All Proton services are open source and independently audited for security.
- Succinct Data Structure Library 3.0☆110Jul 1, 2026Updated 2 months ago
- A C++ library implementing fast language models estimation using the 1-Sort algorithm.☆16May 18, 2023Updated 3 years ago
- String Visualizer☆13Sep 12, 2026Updated 2 weeks ago
- 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
- Collection of succinct data structures in Rust☆108Aug 31, 2026Updated 3 weeks ago
- AirIndex: Versatile Index Tuning Through Data and Storage☆11Dec 18, 2024Updated last year
- TU DOrtmund lossless COMPression framework☆20Sep 7, 2024Updated 2 years ago
- Dynamic Score-Decomposed Tries which more efficiently solve the prefix autocomplete problem☆28Mar 30, 2025Updated last year
- 🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.☆15Jun 28, 2022Updated 4 years ago
- AI Agents on DigitalOcean Gradient AI Platform • AdBuild production-ready AI agents using customizable tools or access multiple LLMs through a single endpoint. Create custom knowledge bases or connect external data.
- A multi-language segmenter using high-order CRF.☆17Feb 27, 2020Updated 6 years ago
- Clustered Elias-Fano inverted indexes.☆14Jun 4, 2018Updated 8 years ago
- Implementation of eBWT using Prefix-free parse (PFP)☆14Jul 14, 2025Updated last year
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆59Jan 27, 2023Updated 3 years ago
- A C++ library providing fast language model queries in compressed space.☆131Feb 25, 2023Updated 3 years ago
- HOT - Height Optimized Trie☆159Mar 26, 2018Updated 8 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
- This is the official repo for the paper "A General Framework for Dynamic Succinct and Compressed Data Structures."☆13Oct 26, 2016Updated 9 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.
- vector illustrations of BWT based searching on small strings☆16Apr 29, 2019Updated 7 years ago
- CodeMirror bindings for ShareDB.☆11Feb 24, 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
- Efficient and effective query auto-completion in C++.☆56Sep 24, 2023Updated 3 years ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆31Jan 8, 2023Updated 3 years ago
- String map implementation through Fast Succinct Trie☆24Jul 9, 2021Updated 5 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆47Sep 4, 2024Updated 2 years ago
- Dynamic succinct/compressed data structures☆120Dec 17, 2025Updated 9 months ago
- Compressed double-array tries for static string dictionaries☆12May 9, 2019Updated 7 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 library of inverted index data structures☆150Dec 15, 2022Updated 3 years ago
- Dumps of CRoaring unity builds (for convenience)☆23Jul 20, 2022Updated 4 years ago
- A Benchmark of Minimal Perfect Hash Function Algorithms.☆39Dec 20, 2022Updated 3 years ago
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆36Apr 7, 2025Updated last year
- Cloud Native Distributed Nearest Neighbour Search☆15Jun 9, 2020Updated 6 years ago
- Automatically exported from code.google.com/p/tx-trie☆29Jun 23, 2015Updated 11 years ago
- Paper Collection for Stringologists☆17Sep 9, 2026Updated 2 weeks ago