quickwit-oss / bitpackingLinks
SIMD algorithms for integer compression via bitpacking. This crate is a port of a C library called simdcomp.
☆312Updated last year
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☆140Updated 2 years ago
- Rust FFI wrapper for CRoaring☆159Updated last week
- A Rust data structure for efficient lower-bound lookups☆92Updated last year
- Native Rust port of Google's HighwayHash, which makes use of SIMD instructions for a fast and strong hash function☆171Updated 3 weeks ago
- Rust interface to io_uring☆336Updated last year
- A suite of non-cryptographic hash functions for Rust.☆139Updated 3 years ago
- Fast generic radix trie implemented in Rust☆203Updated 2 years ago
- Xor filters - efficient probabilistic hashsets. Faster and smaller than bloom and cuckoo filters.☆145Updated last week
- SIMD Floating point and integer compressed vector library☆81Updated last year
- Pure-Rust implementation of Fast Static Symbol Tables string compression☆165Updated this week
- lock-free B+ tree☆298Updated last year
- Rust library for fast multi-pattern searching.☆86Updated 8 years ago
- Fast, SIMD-accelerated CRC32 (IEEE) checksum computation in Rust☆305Updated 2 months ago
- Decoding and encoding gigabytes of LEB128 variable-length integers per second in Rust with SIMD☆127Updated last year
- A fast Bloom filter implementation in Rust☆263Updated 2 months ago
- An on-disk hash table implementation☆124Updated 3 years ago
- Cuckoo Filter: Practically Better Than Bloom (In Rust)☆285Updated 2 years ago
- Simple probabilistic data structures☆147Updated last week
- Fast, efficient, and robust memory reclamation for Rust.☆434Updated 3 months ago
- A better compressed bitset in Rust☆830Updated last month
- Super-fast float parser in Rust (now part of Rust core)☆280Updated 2 years ago
- Fast suffix arrays for Rust (with Unicode support).☆276Updated last year
- An idiomatic and fast QP-trie implementation in pure Rust.☆102Updated last year
- Rust implementation for T1HA (Fast Positive Hash)☆90Updated last year
- A linked-list based, lock-free concurrent hashmap in Rust.☆164Updated 5 years ago
- Adaptive Radix Tree in Rust☆67Updated 7 years ago
- A lock-free, partially wait-free, eventually consistent, concurrent hashmap.☆255Updated 3 years ago
- A benchmarking harness for concurrent key-value collections☆120Updated 2 years ago
- Concurrently Readable Data Structures for Rust☆360Updated 2 months ago
- garbage-collecting on-disk object store, supporting higher level KV stores and databases.☆402Updated 6 months ago