COllapsed and COmpressed trie: a data-aware compressed string dictionary
β36Nov 16, 2026Updated this week
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
- π 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
- ECLYPSE: An Edge-Cloud python platform for simulated (and emulated) runtime environmentsβ41Updated this week
- β39Oct 19, 2023Updated 3 years ago
- Learned Monotone Minimal Perfect Hashingβ32Sep 13, 2026Updated 2 months ago
- Managed Kubernetes at scale on DigitalOcean β’ AdDigitalOcean Kubernetes includes the control plane, bandwidth allowance, container registry, automatic updates, and more for free.
- 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β59Feb 15, 2022Updated 4 years ago
- AI-Toolkit collecting and implementing the AI modules for a TEACHING application.β29Jul 17, 2023Updated 3 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
- Serverless GPU API endpoints on Runpod - Get Bonus Credits β’ AdSkip the infrastructure headaches. Auto-scaling, pay-as-you-go, no-ops approach lets you focus on innovating your application.
- Bumped Ribbon Retrieval and Approximate Membership Queryβ52Sep 13, 2026Updated 2 months ago
- Prefix Filter: Practically and Theoretically Better Than Bloom.β50Sep 12, 2022Updated 4 years ago
- FLYPSE: Federated learning emulation on the cloud-edge continuum, built on ECLYPSE.β26Updated this week
- Space efficient (graph) algorithmsβ17Sep 10, 2020Updated 6 years ago
- Compressed double-array tries for static string dictionariesβ12May 9, 2019Updated 7 years ago
- Compact Tree Representationβ16Mar 16, 2017Updated 9 years ago
- High-speed Bloom filters and taffy filters for C, C++, and Javaβ35Aug 9, 2023Updated 3 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
- 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.
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.β17Nov 10, 2021Updated 5 years ago
- A (Minimal) Perfect Hash Function based on irregular cuckoo hashing, retrieval, and overloading.β20Sep 30, 2025Updated last year
- β12Feb 13, 2020Updated 6 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".β59Jan 27, 2023Updated 3 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
- This is the official repo for the paper "A General Framework for Dynamic Succinct and Compressed Data Structures."β13Oct 26, 2016Updated 10 years ago
- A Benchmark of Minimal Perfect Hash Function Algorithms.β40Dec 20, 2022Updated 3 years ago
- Implementation of the u-indexβ12Jul 19, 2025Updated last year
- Serverless GPU API endpoints on Runpod - Get Bonus Credits β’ AdSkip the infrastructure headaches. Auto-scaling, pay-as-you-go, no-ops approach lets you focus on innovating your application.
- Resolving architectural smells in microservices via refactorings.β15Jun 26, 2024Updated 2 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
- β15Updated this week
- Tries in C++β14Aug 20, 2020Updated 6 years ago
- β15Oct 31, 2026Updated 3 weeks ago
Are these results useful?