C++ Library implementing Compressed String Dictionaries
☆47Apr 25, 2022Updated 3 years ago
Alternatives and similar repositories for libCSD
Users that are interested in libCSD are comparing it to the libraries listed below
Sorting:
- Compressed double-array tries for static string dictionaries☆11May 9, 2019Updated 6 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆58Jan 27, 2023Updated 3 years ago
- A fast, compact trigram library for Icelandic.☆11Dec 12, 2025Updated 3 months ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆36Jan 8, 2023Updated 3 years ago
- Efficient Prefix-Sum data structures in C++.☆27Oct 1, 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
- Compact Data Structures Library☆102Jun 20, 2022Updated 3 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆15Aug 7, 2018Updated 7 years ago
- Packed and Compressed Hash Tables☆15Apr 7, 2025Updated 11 months ago
- Universe-sliced indexes in C++.☆18Jan 8, 2023Updated 3 years ago
- LOUDS-trie implementation example (C++)☆14Nov 27, 2019Updated 6 years ago
- String map implementation through Fast Succinct Trie☆23Jul 9, 2021Updated 4 years ago
- COllapsed and COmpressed trie: a data-aware compressed string dictionary☆36Updated this week
- Static Huffman coding☆10Apr 3, 2017Updated 8 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆55Jan 3, 2024Updated 2 years ago
- Fast compressed trie dictionary library☆72Sep 20, 2024Updated last year
- 🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.☆15Jun 28, 2022Updated 3 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
- Algorihms about Suffix Array Construction, Suffix Tree, Longest Common Prefix, Burrows Wheeler Transform,☆12Oct 26, 2019Updated 6 years ago
- similarity join and search algorithms for edit distance and jaccard☆19Dec 17, 2017Updated 8 years ago
- Implementation of eBWT using Prefix-free parse (PFP)☆14Jul 14, 2025Updated 8 months ago
- GPU-Accelerated Faster Decoding of Integer Lists☆13Aug 20, 2019Updated 6 years ago
- A C++ library providing fast language model queries in compressed space.☆132Feb 25, 2023Updated 3 years ago
- RDF Graph Database (http://grid.hust.edu.cn/triplebit/)☆11Sep 19, 2014Updated 11 years ago
- ☆13Nov 15, 2017Updated 8 years ago
- A blend of the compact and sparse hash table implementations.☆15Aug 20, 2021Updated 4 years ago
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Nov 10, 2021Updated 4 years ago
- C++ Implementation of Zip Trees☆14Nov 5, 2022Updated 3 years ago
- ⚙️🛠️ Essential C++ utilities.☆14Mar 9, 2026Updated last week
- Efficient and effective query auto-completion in C++.☆56Sep 24, 2023Updated 2 years ago
- Official repository of "Efficient and Effective Query Expansion for Web Search", Short Paper @ CIKM 2018☆15Nov 17, 2019Updated 6 years ago
- High-performance dictionary coding☆110Apr 5, 2017Updated 8 years ago
- This program implements the following graph reordering technique: Laxman Dhulipala, Igor Kabiljo, Brian Karrer, Giuseppe Ottaviano, Serg…☆10Sep 13, 2018Updated 7 years ago
- Space efficient (graph) algorithms☆18Sep 10, 2020Updated 5 years ago
- C++17 implementation of memory-efficient dynamic tries☆58Feb 15, 2022Updated 4 years ago
- Suite of universal indexes for Highly Repetitive Document Collections☆24May 14, 2020Updated 5 years ago
- A Rust implementation of the Quad Wavelet Tree☆51Jan 31, 2026Updated last month
- SUccinct Retrieval Framework☆21Jan 24, 2016Updated 10 years ago
- Teaching implementation of the TurboPFor integer compression algorithm☆23Feb 5, 2019Updated 7 years ago