COllapsed and COmpressed trie: a data-aware compressed string dictionary
☆36Apr 9, 2026Updated 6 months ago
Alternatives and similar repositories for CoCo-trie
Users that are interested in CoCo-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:
- ☆13Jul 15, 2025Updated last year
- ☆39Oct 19, 2023Updated 3 years ago
- ECLYPSE: An Edge-Cloud python platform for simulated (and emulated) runtime environments☆39Updated this week
- Learned Monotone Minimal Perfect Hashing☆32Sep 13, 2026Updated last month
- 🚀 The first learned approach to the Range Minimum Query (RMQ) problem, providing robust theoretical guarantees and novel space-time trad…☆14Sep 11, 2025Updated last year
- 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.
- 🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.☆15Jun 28, 2022Updated 4 years ago
- String map implementation through Fast Succinct Trie☆24Jul 9, 2021Updated 5 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆36Jan 8, 2023Updated 3 years ago
- C++17 implementation of memory-efficient dynamic tries☆58Feb 15, 2022Updated 4 years ago
- C++ Library implementing Compressed String Dictionaries☆47Apr 25, 2022Updated 4 years ago
- Static Huffman coding☆10Apr 3, 2017Updated 9 years ago
- Grafite is a data structure that enables fast range emptiness queries using optimal space and time.☆14Dec 9, 2024Updated last year
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆47Sep 4, 2024Updated 2 years ago
- Fast compressed trie dictionary library☆73Sep 20, 2024Updated 2 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.
- FLYPSE: Federated Learning framework based on ECLYPSE☆23Oct 22, 2026Updated last week
- Bumped Ribbon Retrieval and Approximate Membership Query☆52Sep 13, 2026Updated last month
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆50Sep 12, 2022Updated 4 years ago
- A C++ library to benchmark inverted indexes.☆25Aug 4, 2020Updated 6 years ago
- Compact Tree Representation☆16Mar 16, 2017Updated 9 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
- A blend of the compact and sparse hash table implementations.☆15Aug 20, 2021Updated 5 years ago
- High-speed Bloom filters and taffy filters for C, C++, and Java☆35Aug 9, 2023Updated 3 years ago
- 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.
- FSA compression paper, data sets and software.☆11Mar 30, 2012Updated 14 years ago
- Implementation of eBWT using Prefix-free parse (PFP)☆14Jul 14, 2025Updated last year
- A C++ library implementing fast language models estimation using the 1-Sort algorithm.☆16May 18, 2023Updated 3 years ago
- A (Minimal) Perfect Hash Function based on irregular cuckoo hashing, retrieval, and overloading.☆20Sep 30, 2025Updated last year
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Nov 10, 2021Updated 4 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆59Jan 27, 2023Updated 3 years ago
- ☆12Feb 13, 2020Updated 6 years ago
- Towards Optimal-Space Minimal Perfect Hashing Beyond Brute-Force☆15Mar 31, 2025Updated last year
- Optimal distance lower bound k-mer sampling.☆12Jun 19, 2024Updated 2 years ago
- 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 Benchmark of Minimal Perfect Hash Function Algorithms.☆39Dec 20, 2022Updated 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
- Implementation of the u-index☆12Jul 19, 2025Updated last year
- Efficient Prefix-Sum data structures in C++.☆28Oct 1, 2023Updated 3 years ago
- Universe-sliced indexes in C++.☆19Jan 8, 2023Updated 3 years ago
- A four-dimensional Analysis of Partitioned Approximate Filters☆11Aug 6, 2025Updated last year
- R-Index-F Library for Pattern Matching☆12Aug 8, 2024Updated 2 years ago