AntonioFerrandez / MergedTrieLinks
MergedTrie code
☆12Updated 5 years ago
Alternatives and similar repositories for MergedTrie
Users that are interested in MergedTrie are comparing it to the libraries listed below
Sorting:
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆29Updated 2 years ago
- A compact implementation of Dr. Askitis HatTrie☆80Updated 11 years ago
- A fast implementation for varbyte 32bit/64bit integer compression☆118Updated 8 years ago
- EliasFanoCompression: quasi-succinct compression of sorted integers in C#☆45Updated 3 years ago
- String Matching Algorithms Research Tool☆102Updated last year
- Fast decoder for VByte-compressed integers☆122Updated last year
- Universe-sliced indexes in C++.☆18Updated 2 years ago
- UMASH: a fast enough hash and fingerprint with collision bounds☆155Updated 4 months ago
- Clustered Elias-Fano inverted indexes.☆15Updated 7 years ago
- An encoder/decoder collection for a sequence of integers☆32Updated 12 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆56Updated 2 years ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆63Updated last year
- Fast Hash Functions Using AES Intrinsics☆82Updated 5 years ago
- Fast C functions for the computing the positional popcount (pospopcnt).☆53Updated 5 years ago
- Testing framework for the quest to find a fast & strong mixer, e. g for hashtables.☆38Updated 4 years ago
- Compact Data Structures Library☆100Updated 2 years ago
- A C++ library for integer array compression☆29Updated 3 years ago
- Succinct data structures in C/C++☆88Updated 7 months ago
- High-performance dictionary coding☆104Updated 8 years ago
- Experiments with array layouts for comparison-based searching☆84Updated last year
- C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference☆53Updated last year
- A simple bitset library in C☆134Updated 3 months ago
- Trinity IR Infrastructure☆238Updated 5 years ago
- Pruning elements in SIMD vectors (i.e., packing left elements)☆65Updated last year
- Assorted notes☆84Updated last year
- My very own vxsort re-implemented with "modern" C++ by a complete idiot (in C++)☆30Updated last year
- C library to compute the Hamming weight of arrays☆46Updated 6 years ago
- Fast implementations of the scancount algorithm: C++ header-only library☆26Updated 5 years ago
- Cache-friendly associative STL-like container with an Eytzinger (BFS) layout for C++☆32Updated 8 years ago
- Highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of n elements supporting access in time O(…☆50Updated last year