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 5 years ago
- Bicriteria Data Compressor☆15Dec 9, 2017Updated 8 years ago
- COllapsed and COmpressed trie: a data-aware compressed string dictionary☆36Apr 9, 2026Updated 6 months ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆15Aug 7, 2018Updated 8 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.
- Succinct Data Structure Library 3.0☆111Updated this week
- A C++ library implementing fast language models estimation using the 1-Sort algorithm.☆16May 18, 2023Updated 3 years ago
- AirIndex: Versatile Index Tuning Through Data and Storage☆12Dec 18, 2024Updated last year
- Universe-sliced indexes in C++.☆19Jan 8, 2023Updated 3 years ago
- Collection of succinct data structures in Rust☆108Oct 10, 2026Updated last week
- TU DOrtmund lossless COMPression framework☆20Sep 7, 2024Updated 2 years ago
- 🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.☆15Jun 28, 2022Updated 4 years ago
- A multi-language segmenter using high-order CRF.☆17Feb 27, 2020Updated 6 years ago
- Dynamic Score-Decomposed Tries which more efficiently solve the prefix autocomplete problem☆28Mar 30, 2025Updated last year
- 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.
- Efficient and effective query auto-completion in C++.☆56Sep 24, 2023Updated 3 years ago
- Implementation of eBWT using Prefix-free parse (PFP)☆14Jul 14, 2025Updated last year
- Clustered Elias-Fano inverted indexes.☆14Jun 4, 2018Updated 8 years ago
- Fast compressed trie dictionary library☆73Sep 20, 2024Updated 2 years ago
- HOT - Height Optimized Trie☆159Mar 26, 2018Updated 8 years ago
- ProphAsm – a rapid computation of simplitigs directly from k-mer sets☆25Feb 17, 2023Updated 3 years ago
- A real-time food detection system that uses a webcam and a fine-tuned YOLOv8 model to dynamically calculate and display the price of dete…☆13Jun 17, 2024Updated 2 years ago
- Linear vs binary search benchmark☆42Dec 12, 2019Updated 6 years ago
- CodeMirror bindings for ShareDB.☆11Feb 24, 2019Updated 7 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
- Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.☆14May 11, 2018Updated 8 years ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆31Jan 8, 2023Updated 3 years ago
- ⚙️🛠️ Essential C++ utilities.☆15Aug 22, 2026Updated last month
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆47Sep 4, 2024Updated 2 years ago
- Cache-friendly, Parallel, and Samplesort-based Constructor for Suffix Arrays and LCP Arrays☆20Jun 23, 2025Updated last year
- Compressed double-array tries for static string dictionaries☆12May 9, 2019Updated 7 years ago
- Dynamic succinct/compressed data structures☆120Dec 17, 2025Updated 10 months ago
- A four-dimensional Analysis of Partitioned Approximate Filters☆11Aug 6, 2025Updated last year
- 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.
- A library of inverted index data structures☆151Dec 15, 2022Updated 3 years ago
- A plain C implementation of the Ternary Search Tree structure with Ruby bindings☆13Jan 19, 2013Updated 13 years ago
- Official repository of the ACM SIGIR 2019 paper: "Fast Approximate Filtering of Search Results Sorted by Attribute" by Franco Maria Nardi…☆14Nov 7, 2019Updated 6 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.☆37Apr 7, 2025Updated last year
- Bloom-filter based minimal perfect hash function library☆280Jul 16, 2025Updated last year
- Fast, Cache-Efficient, and Scalable Queries on Pangenomes☆46Mar 9, 2026Updated 7 months ago