quickwit-oss / bitpackingLinks
SIMD algorithms for integer compression via bitpacking. This crate is a port of a C library called simdcomp.
☆327Updated 3 weeks ago
Alternatives and similar repositories for bitpacking
Users that are interested in bitpacking are comparing it to the libraries listed below
Sorting:
- Rust library implementing xor-filters☆145Updated 2 years ago
- Rust FFI wrapper for CRoaring☆164Updated this week
- Native Rust port of Google's HighwayHash, which makes use of SIMD instructions for a fast and strong hash function☆176Updated 5 months ago
- A Rust data structure for efficient lower-bound lookups☆92Updated last year
- Rust interface to io_uring☆339Updated last year
- A suite of non-cryptographic hash functions for Rust.☆142Updated 3 years ago
- Fast suffix arrays for Rust (with Unicode support).☆281Updated 2 years ago
- Xor filters - efficient probabilistic hashsets. Faster and smaller than bloom and cuckoo filters.☆157Updated last month
- Fast generic radix trie implemented in Rust☆214Updated 4 months ago
- Adaptive Radix Tree in Rust☆67Updated 7 years ago
- Decoding and encoding gigabytes of LEB128 variable-length integers per second in Rust with SIMD☆135Updated last year
- Super-fast float parser in Rust (now part of Rust core)☆288Updated 3 years ago
- SIMD Floating point and integer compressed vector library☆80Updated 2 years ago
- Rust library for fast multi-pattern searching.☆88Updated 9 years ago
- Rust implementation for T1HA (Fast Positive Hash)☆90Updated last year
- Pure-Rust implementation of Fast Static Symbol Tables string compression☆205Updated last week
- An idiomatic and fast QP-trie implementation in pure Rust.☆102Updated last year
- Pillars for Transactional Systems and Data Grids☆133Updated last year
- Rust implementation of the FastLanes compression library☆161Updated this week
- ☆76Updated 11 months ago
- A benchmarking harness for concurrent key-value collections☆119Updated 3 years ago
- Cuckoo Filter: Practically Better Than Bloom (In Rust)☆289Updated 3 months ago
- Simple probabilistic data structures☆148Updated this week
- A port of HdrHistogram to Rust☆337Updated last year
- lock-free B+ tree☆309Updated last year
- Proactive IO & Runtime system☆276Updated last year
- High-throughput columnar serialization in Rust☆189Updated 3 weeks ago
- Concurrently Readable Data Structures for Rust☆363Updated this week
- A linked-list based, lock-free concurrent hashmap in Rust.☆164Updated 6 years ago
- A fast, non-secure, hashing algorithm derived from an internal hasher in FireFox.☆279Updated 2 years ago