fwessels / simdcsvLinks
☆36Updated 4 years ago
Alternatives and similar repositories for simdcsv
Users that are interested in simdcsv are comparing it to the libraries listed below
Sorting:
- Faster integer compression in Go with SIMD using StreamVByte codec☆42Updated 2 years ago
- A port of Stream VByte to Go☆35Updated 3 years ago
- fixed-length integer trim☆34Updated 2 years ago
- Fast division, modulus and divisibility checks in Go for divisors known only at runtime.☆117Updated 6 years ago
- Go implementation of SIMD-BP128 integer encoding and decoding☆30Updated 3 years ago
- Fast integer compression library☆95Updated 6 months ago
- Teaching implementation of the TurboPFor integer compression algorithm☆22Updated 6 years ago
- AVX-2 vectorised 8-bit positional popcount for Go☆23Updated 4 years ago
- SSE-optimized group varint integer encoding☆37Updated 2 years ago
- Fast lossless compression of floating point data in Go☆53Updated last year
- Go implementation of Stream VByte integer compression☆23Updated 5 years ago
- Golang port of simdjson☆86Updated 5 years ago
- minimal perfect hash functions☆62Updated 3 years ago
- Bloom-filter based search index☆124Updated 3 years ago
- ☆77Updated 4 years ago
- Fast implementations of the scancount algorithm: C++ header-only library☆27Updated 5 years ago
- UMASH: a fast enough hash and fingerprint with collision bounds☆157Updated 7 months ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- A Go library for space-efficient rank/select operations for both sparse and dense bit arrays.☆37Updated 5 years ago
- An log structured merge tree varient of nitro storage engine☆29Updated 8 years ago
- Efficient DAWG implementation in GO☆51Updated 2 years ago
- Fast differential coding functions (using SIMD instructions)☆54Updated 7 years ago
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆48Updated 2 years ago
- a fast counting quotient filter implementation in golang☆95Updated 3 years ago
- A golang streaming histogram sketch. Fast quantiles and counts below a threshold.☆44Updated 2 years ago
- Highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of n elements supporting access in time O(…☆50Updated last year
- Positional Population Count for Go☆68Updated 2 months ago
- Cuckoo Index: A Lightweight Secondary Index Structure☆129Updated 3 years ago
- Go wrapper for CRoaring☆46Updated 2 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆54Updated last year