google / gipfeliLinks
☆117Updated 8 years ago
Alternatives and similar repositories for gipfeli
Users that are interested in gipfeli are comparing it to the libraries listed below
Sorting:
- Fast decoder for VByte-compressed integers☆123Updated last year
- Fast and Reliable (but not Secure) Hash☆54Updated 7 years ago
- ☆142Updated last year
- Benchmark showing the we can randomly hash strings very quickly with good universality☆137Updated 5 months ago
- Iterator library.☆79Updated 5 years ago
- A benchmark of some prominent C/C++ hash table implementations☆105Updated 6 years ago
- Rolling Hash C++ Library☆187Updated last year
- A fast implementation for varbyte 32bit/64bit integer compression☆119Updated 8 years ago
- MetroHash v1: Exceptionally fast and statistically robust hash functions☆370Updated 2 years ago
- Compute xxHash hash codes for 8 keys in parallel☆46Updated 6 years ago
- MDBM a very fast memory-mapped key/value store.☆77Updated 2 years ago
- multi-way atomic compare-and-swap with x64/TSX☆86Updated 8 years ago
- A compact implementation of Dr. Askitis HatTrie☆80Updated 11 years ago
- A portable in-place bitwise binary Fredkin trie algorithm which allows for near constant time insertions, deletions, finds, closest fit f…☆275Updated 3 years ago
- Hashing functions and PRNGs based on them☆162Updated 5 months ago
- Trinity IR Infrastructure☆238Updated 5 years ago
- Supersonic is an ultra-fast, column oriented query engine library written in C++☆206Updated 4 years ago
- rANS coder (derived from https://github.com/rygorous/ryg_rans)☆83Updated 3 years ago
- A C++ library for concurrent programming☆71Updated 4 years ago
- C library implementing the ridiculously fast CLHash hashing function☆279Updated last year
- generate perfect hashes (alpha)☆77Updated 3 years ago
- Memory-mapped storage library☆76Updated 9 years ago
- TurboRLE-Fastest Run Length Encoding☆287Updated 2 years ago
- bit & sketches data structures☆60Updated 6 years ago
- Fast differential coding functions (using SIMD instructions)☆54Updated 7 years ago
- Fastest Histogram Construction☆70Updated 3 years ago
- Fastest auto-complete in the east☆259Updated 2 years ago
- An efficient trie implementation.☆255Updated 4 years ago
- Feed-forward Bloom filters☆52Updated 14 years ago
- High-performance dictionary coding☆104Updated 8 years ago