Fast compressed trie dictionary library
☆72Sep 20, 2024Updated last year
Alternatives and similar repositories for xcdat
Users that are interested in xcdat are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- String map implementation through Fast Succinct Trie☆23Jul 9, 2021Updated 4 years ago
- Compressed double-array tries for static string dictionaries☆11May 9, 2019Updated 6 years ago
- COllapsed and COmpressed trie: a data-aware compressed string dictionary☆36Updated this week
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆36Jan 8, 2023Updated 3 years ago
- C++ Library implementing Compressed String Dictionaries☆47Apr 25, 2022Updated 3 years ago
- Static Huffman coding☆10Apr 3, 2017Updated 8 years ago
- Garbage collected concurrent hash tries.☆19Jan 1, 2017Updated 9 years ago
- C++17 implementation of memory-efficient dynamic tries☆58Feb 15, 2022Updated 4 years ago
- Clustered Elias-Fano inverted indexes.☆15Jun 4, 2018Updated 7 years ago
- MergedTrie code☆12Jan 22, 2020Updated 6 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
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆31Jan 8, 2023Updated 3 years ago
- A clone of Darts (Double-ARray Trie System)☆160May 14, 2025Updated 10 months ago
- A programming language☆14Jan 24, 2015Updated 11 years ago
- A minimal modern (Lua)TeX distribution☆15May 12, 2024Updated last year
- A TeX implementation in a single C++11 class.☆19Sep 19, 2020Updated 5 years ago
- Small strings compression library☆41Nov 11, 2020Updated 5 years ago
- qp tries and crit-bit tries☆124Jul 12, 2022Updated 3 years ago
- HDFS based on Java implementation as a remote ObjectStore for DataFusion☆10Feb 13, 2024Updated 2 years ago
- MemEC: An Erasure-Coding-Based Distributed In-Memory Key-Value Store☆11Mar 30, 2017Updated 8 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆55Jan 3, 2024Updated 2 years ago
- Fast User Level LOCK library☆27Oct 6, 2025Updated 5 months ago
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Nov 10, 2021Updated 4 years ago
- A cheatsheet for most common Stringology tasks☆14Apr 14, 2021Updated 4 years ago
- ProphAsm – a rapid computation of simplitigs directly from k-mer sets☆25Feb 17, 2023Updated 3 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆46Sep 4, 2024Updated last year
- The libsais library provides fast linear-time construction of suffix array (SA), generalized suffix array (GSA), longest common prefix (L…☆238Sep 10, 2025Updated 6 months ago
- Implementation of a Backpack Quotient Filter☆13Jul 7, 2025Updated 8 months ago
- Efficient Prefix-Sum data structures in C++.☆27Oct 1, 2023Updated 2 years ago
- Learned Monotone Minimal Perfect Hashing☆31Apr 1, 2025Updated 11 months ago
- Sequence Bloom Trees with All/Some split☆11Oct 30, 2018Updated 7 years ago
- Shaded version of Apache Hive for Trino☆10Aug 13, 2024Updated last year
- A C++ library providing fast language model queries in compressed space.☆132Feb 25, 2023Updated 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
- ☆21May 12, 2012Updated 13 years ago
- Rust library providing fast language model queries in compressed space☆25Oct 1, 2022Updated 3 years ago
- Fast Binary Translator for the Kernel☆28Sep 23, 2013Updated 12 years ago
- Keyvi - the key value index. It is an in-memory FST-based data structure highly optimized for size and lookup performance.☆257Mar 17, 2026Updated last week
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆58Jan 27, 2023Updated 3 years ago