quickwit-oss / bitpackingLinks
SIMD algorithms for integer compression via bitpacking. This crate is a port of a C library called simdcomp.
☆321Updated 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 2 weeks ago
- Native Rust port of Google's HighwayHash, which makes use of SIMD instructions for a fast and strong hash function☆173Updated 4 months ago
- A Rust data structure for efficient lower-bound lookups☆92Updated last year
- A suite of non-cryptographic hash functions for Rust.☆142Updated 3 years ago
- SIMD Floating point and integer compressed vector library☆80Updated 2 years ago
- Xor filters - efficient probabilistic hashsets. Faster and smaller than bloom and cuckoo filters.☆150Updated last week
- Rust interface to io_uring☆337Updated last year
- Fast suffix arrays for Rust (with Unicode support).☆279Updated 2 years ago
- lock-free B+ tree☆308Updated last year
- Pure-Rust implementation of Fast Static Symbol Tables string compression☆192Updated this week
- A port of HdrHistogram to Rust☆334Updated last year
- Decoding and encoding gigabytes of LEB128 variable-length integers per second in Rust with SIMD☆134Updated last year
- Fast generic radix trie implemented in Rust☆213Updated 3 months ago
- Rust library for fast multi-pattern searching.☆86Updated 8 years ago
- Simple probabilistic data structures☆147Updated this week
- Fast, SIMD-accelerated CRC32 (IEEE) checksum computation in Rust☆312Updated 5 months ago
- Cuckoo Filter: Practically Better Than Bloom (In Rust)☆289Updated last month
- On-Disk B+ Tree implemented in Rust☆211Updated 5 years ago
- A rust implementation of murmur3☆74Updated last year
- A benchmarking harness for concurrent key-value collections☆118Updated 2 years ago
- An idiomatic and fast QP-trie implementation in pure Rust.☆102Updated last year
- A fast, non-secure, hashing algorithm derived from an internal hasher in FireFox.☆278Updated last year
- Adaptive Radix Tree in Rust☆67Updated 7 years ago
- Concurrently Readable Data Structures for Rust☆362Updated 5 months ago
- a lock-free concurrent slab (experimental)☆302Updated 11 months ago
- garbage-collecting on-disk object store, supporting higher level KV stores and databases.☆409Updated last month
- A better compressed bitset in Rust☆878Updated this week
- Proactive IO & Runtime system☆275Updated last year
- Super-fast float parser in Rust (now part of Rust core)☆285Updated 3 years ago