COllapsed and COmpressed trie: a data-aware compressed string dictionary
☆36Feb 15, 2025Updated last year
Alternatives and similar repositories for CoCo-trie
Users that are interested in CoCo-trie are comparing it to the libraries listed below
Sorting:
- ☆12Jul 15, 2025Updated 7 months ago
- String map implementation through Fast Succinct Trie☆23Jul 9, 2021Updated 4 years ago
- C++17 implementation of memory-efficient dynamic tries☆58Feb 15, 2022Updated 4 years ago
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Nov 10, 2021Updated 4 years ago
- This is the code for our self-designing range filter as described in our SIGMOD'22 paper of the same name.☆14Feb 23, 2023Updated 3 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆46Sep 4, 2024Updated last year
- Compact Tree Representation☆16Mar 16, 2017Updated 8 years ago
- Bumped Ribbon Retrieval and Approximate Membership Query☆51Jun 16, 2025Updated 8 months ago
- Fast compressed trie dictionary library☆71Sep 20, 2024Updated last year
- A C++ library to benchmark inverted indexes.☆21Aug 4, 2020Updated 5 years ago
- A library that provides an embeddable, persistent key-value store for fast storage.☆38Dec 20, 2018Updated 7 years ago
- Implementation of a Backpack Quotient Filter☆13Jul 7, 2025Updated 7 months ago
- Static Huffman coding☆10Apr 3, 2017Updated 8 years ago
- Implementation of eBWT using Prefix-free parse (PFP)☆14Jul 14, 2025Updated 7 months ago
- 🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.☆15Jun 28, 2022Updated 3 years ago
- ☆11Feb 13, 2020Updated 6 years ago
- A four-dimensional Analysis of Partitioned Approximate Filters☆11Aug 6, 2025Updated 6 months ago
- Compressed double-array tries for static string dictionaries☆11May 9, 2019Updated 6 years ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆31Jan 8, 2023Updated 3 years ago
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆34Apr 7, 2025Updated 10 months ago
- Efficient and effective query auto-completion in C++.☆57Sep 24, 2023Updated 2 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
- A new lossless data compression algorithm☆12Nov 19, 2025Updated 3 months ago
- Grafite is a data structure that enables fast range emptiness queries using optimal space and time.☆14Dec 9, 2024Updated last year
- Essential C++ utilities.☆14Nov 13, 2025Updated 3 months ago
- A Benchmark of Minimal Perfect Hash Function Algorithms.☆38Dec 20, 2022Updated 3 years ago
- Code repository for SNARF☆13Apr 27, 2023Updated 2 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
- Succinct data structures in C/C++☆94Oct 7, 2024Updated last year
- Universe-sliced indexes in C++.☆18Jan 8, 2023Updated 3 years ago
- Succinct Data Structure Library 3.0☆103Dec 15, 2025Updated 2 months ago
- High-speed Bloom filters and taffy filters for C, C++, and Java☆35Aug 9, 2023Updated 2 years ago
- ☆37Nov 5, 2020Updated 5 years ago
- Fast, Cache-Efficient, and Scalable Queries on Pangenomes☆36Nov 7, 2025Updated 3 months ago
- Wavelet tree based on a fixed block boosting technique☆16May 18, 2021Updated 4 years ago
- ☆16Mar 16, 2021Updated 4 years ago
- C++ implementation of Concise and WAH compressed bitsets☆20Mar 31, 2017Updated 8 years ago
- ☆39Jun 20, 2020Updated 5 years ago
- Fast TPC-C input generator in c++☆17Mar 5, 2022Updated 4 years ago