kampersanda / xcdatLinks
Fast compressed trie dictionary library
☆69Updated 9 months ago
Alternatives and similar repositories for xcdat
Users that are interested in xcdat are comparing it to the libraries listed below
Sorting:
- C++17 implementation of memory-efficient dynamic tries☆58Updated 3 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- Universe-sliced indexes in C++.☆18Updated 2 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆56Updated 2 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆54Updated last year
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆29Updated 2 years ago
- C++ Library implementing Compressed String Dictionaries☆46Updated 3 years ago
- String map implementation through Fast Succinct Trie☆21Updated 3 years ago
- Compact Tree Representation☆16Updated 8 years ago
- C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference☆54Updated last year
- A C++ container-like data structure for storing a vector of bits with fast appending on both sides and fast insertion in the middle, all …☆26Updated 3 years ago
- A single file C++17 header-only Minimal Acyclic Subsequential Transducers, or Finite State Transducers☆56Updated 2 years ago
- Clustered Elias-Fano inverted indexes.☆15Updated 7 years ago
- Succinct data structures in C/C++☆89Updated 8 months ago
- A fast implementation for varbyte 32bit/64bit integer compression☆119Updated 8 years ago
- Fast differential coding functions (using SIMD instructions)☆54Updated 7 years ago
- Efficient Prefix-Sum data structures in C++.☆26Updated last year
- Fast implementations of the scancount algorithm: C++ header-only library☆27Updated 5 years ago
- A C++ library providing fast language model queries in compressed space.☆130Updated 2 years ago
- Compressed double-array tries for static string dictionaries☆11Updated 6 years ago
- Compact Data Structures Library☆100Updated 3 years ago
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Updated 3 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 years ago
- A clone of Darts (Double-ARray Trie System)☆149Updated last month
- Efficient and effective query auto-completion in C++.☆54Updated last year
- For details, see the blog post:☆32Updated last year
- SIMD (SSE) string functions☆102Updated 7 years ago
- String Matching Algorithms Research Tool☆103Updated last year
- C library to compute the Hamming weight of arrays☆47Updated 6 years ago
- 🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.☆11Updated 2 years ago