kampersanda / cda-triesLinks
Compressed double-array tries for static string dictionaries
☆11Updated 6 years ago
Alternatives and similar repositories for cda-tries
Users that are interested in cda-tries are comparing it to the libraries listed below
Sorting:
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆57Updated 2 years ago
- C++ Library implementing Compressed String Dictionaries☆46Updated 3 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- Fast Hash Functions Using AES Intrinsics☆84Updated 6 years ago
- Compact Data Structures Library☆101Updated 3 years ago
- A fast implementation for varbyte 32bit/64bit integer compression☆120Updated 8 years ago
- Experiments with array layouts for comparison-based searching☆85Updated last year
- A collection of succinct data structures☆211Updated last year
- Highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of n elements supporting access in time O(…☆50Updated last year
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆31Updated 2 years ago
- ☆37Updated 5 years ago
- Compact Data Structures Library☆129Updated 11 years ago
- Fast compressed trie dictionary library☆71Updated last year
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆15Updated 7 years ago
- UMASH: a fast enough hash and fingerprint with collision bounds☆159Updated 3 weeks ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆55Updated last year
- C++17 implementation of memory-efficient dynamic tries☆58Updated 3 years ago
- Universe-sliced indexes in C++.☆18Updated 2 years ago
- SIMD recipes, for various platforms (collection of code snippets)☆49Updated 4 years ago
- High-performance dictionary coding☆108Updated 8 years ago
- qp tries and crit-bit tries☆122Updated 3 years ago
- haesni is a small hash function using aes-ni for fast string hashing☆19Updated 7 years ago
- Detailed experiments over simdjson for VLDB article (2019) and future work☆21Updated 5 years ago
- Succinct data structures in C/C++☆91Updated last year
- A benchmark for sorting algorithms☆62Updated 4 years ago
- Random Number Generator based on hardware-accelerated AES instructions☆61Updated 6 years ago
- Fast decoder for VByte-compressed integers☆125Updated 2 weeks ago
- Fast implementations of the scancount algorithm: C++ header-only library☆27Updated 6 years ago
- Bitset Sort, a faster std::sort replacement.☆78Updated 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