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 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 5 months 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.
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆15Aug 7, 2018Updated 7 years ago
- String Visualizer☆12Dec 18, 2025Updated 4 months ago
- AirIndex: Versatile Index Tuning Through Data and Storage☆10Dec 18, 2024Updated last year
- Universe-sliced indexes in C++.☆18Jan 8, 2023Updated 3 years ago
- Clustered Elias-Fano inverted indexes.☆15Jun 4, 2018Updated 7 years ago
- Implementation of eBWT using Prefix-free parse (PFP)☆14Jul 14, 2025Updated 9 months ago
- A C++ library providing fast language model queries in compressed space.☆133Feb 25, 2023Updated 3 years ago
- Cache-friendly, Parallel, and Samplesort-based Constructor for Suffix Arrays and LCP Arrays☆18Jun 23, 2025Updated 10 months ago
- HOT - Height Optimized Trie☆158Mar 26, 2018Updated 8 years ago
- Proton VPN Special Offer - Get 70% off • AdSpecial partner offer. Trusted by over 100 million users worldwide. Tested, Approved and Recommended by Experts.
- This is the official repo for the paper "A General Framework for Dynamic Succinct and Compressed Data Structures."☆13Oct 26, 2016Updated 9 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
- ⚙️🛠️ 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
- Fast, Cache-Efficient, and Scalable Queries on Pangenomes☆41Mar 9, 2026Updated 2 months ago
- Dynamic succinct/compressed data structures☆117Dec 17, 2025Updated 4 months ago
- Open source password manager - Proton Pass • AdSecurely store, share, and autofill your credentials with Proton Pass, the end-to-end encrypted password manager trusted by millions.
- 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 7 years ago
- A tool for visualizing the internal structures of morphological analyzer Sudachi☆18Jun 9, 2022Updated 3 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 5 years ago
- A Benchmark of Minimal Perfect Hash Function Algorithms.☆38Dec 20, 2022Updated 3 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.
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆34Apr 7, 2025Updated last year
- Automatically exported from code.google.com/p/tx-trie☆29Jun 23, 2015Updated 10 years ago
- A self-contained, header-only, implementation of memory-mapped files in C++ for fast integration into larger projects.☆27Aug 22, 2024Updated last year
- Paper Collection for Stringologists☆17Mar 29, 2026Updated last month
- Yada is a yet another double-array trie library aiming for fast search and compact data representation.☆48Feb 25, 2024Updated 2 years ago
- C++ implementation of a fast and memory efficient HAT-trie☆865Nov 11, 2025Updated 5 months ago
- C++ semantic toolkit + sparqlite RDF database☆20May 25, 2023Updated 2 years ago