quickwit-oss / bitpackingLinks
SIMD algorithms for integer compression via bitpacking. This crate is a port of a C library called simdcomp.
☆318Updated 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☆142Updated 2 years ago
- Rust FFI wrapper for CRoaring☆161Updated last month
- A suite of non-cryptographic hash functions for Rust.☆142Updated 3 years ago
- 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☆172Updated 3 months ago
- Rust interface to io_uring☆337Updated last year
- Simple probabilistic data structures☆146Updated last week
- Fast suffix arrays for Rust (with Unicode support).☆278Updated 2 years ago
- Fast generic radix trie implemented in Rust☆213Updated 2 months ago
- Xor filters - efficient probabilistic hashsets. Faster and smaller than bloom and cuckoo filters.☆147Updated 2 weeks ago
- SIMD Floating point and integer compressed vector library☆80Updated last year
- Pure-Rust implementation of Fast Static Symbol Tables string compression☆188Updated this week
- Decoding and encoding gigabytes of LEB128 variable-length integers per second in Rust with SIMD☆132Updated last year
- Rust library for fast multi-pattern searching.☆86Updated 8 years ago
- Fast, SIMD-accelerated CRC32 (IEEE) checksum computation in Rust☆311Updated 4 months ago
- Adaptive Radix Tree in Rust☆67Updated 7 years ago
- An idiomatic and fast QP-trie implementation in pure Rust.☆102Updated last year
- lock-free B+ tree☆305Updated last year
- Super-fast float parser in Rust (now part of Rust core)☆284Updated 3 years ago
- Rust implementation for T1HA (Fast Positive Hash)☆90Updated last year
- A port of HdrHistogram to Rust☆332Updated last year
- High-throughput columnar serialization in Rust☆186Updated last week
- Pillars for Transactional Systems and Data Grids☆133Updated last year
- An on-disk hash table implementation☆126Updated 4 years ago
- Concurrently Readable Data Structures for Rust☆362Updated 5 months ago
- A fast Bloom filter implementation in Rust☆268Updated last month
- A better compressed bitset in Rust☆873Updated 2 months ago
- A benchmarking harness for concurrent key-value collections☆118Updated 2 years ago
- Proactive IO & Runtime system☆276Updated last year
- Cuckoo Filter: Practically Better Than Bloom (In Rust)☆288Updated last month