Alternatives and similar repositories for simdcsv

Users that are interested in simdcsv are comparing it to the libraries listed below

• rleiwang / svb
  Faster integer compression in Go with SIMD using StreamVByte codec
  ☆43Updated 2 years ago
• nelz9999 / stream-vbyte-go
  A port of Stream VByte to Go
  ☆35Updated 3 years ago
• pascaldekloe / flit
  fixed-length integer trim
  ☆35Updated 2 years ago
• bmkessler / fastdiv
  Fast division, modulus and divisibility checks in Go for divisors known only at runtime.
  ☆118Updated 6 years ago
• robskie / bp128
  Go implementation of SIMD-BP128 integer encoding and decoding
  ☆31Updated 3 years ago
• clausecker / pospopcnt
  AVX-2 vectorised 8-bit positional popcount for Go
  ☆23Updated 5 years ago
• spenczar / fpc
  Fast lossless compression of floating point data in Go
  ☆55Updated 2 years ago
• dgryski / go-groupvarint
  SSE-optimized group varint integer encoding
  ☆39Updated 2 years ago
• ronanh / intcomp
  Fast integer compression library
  ☆96Updated 9 months ago
• bmkessler / streamvbyte
  Go implementation of Stream VByte integer compression
  ☆23Updated 5 years ago
• fwessels / simdjson-go
  Golang port of simdjson
  ☆86Updated 5 years ago
• lemire / fastscancount
  Fast implementations of the scancount algorithm: C++ header-only library
  ☆27Updated 6 years ago
• smhanov / dawg
  Efficient DAWG implementation in GO
  ☆52Updated 3 years ago
• dgryski / go-bloomindex
  Bloom-filter based search index
  ☆126Updated 4 years ago
• dgryski / go-mph
  minimal perfect hash functions
  ☆64Updated 4 years ago
• clausecker / pospop
  Positional Population Count for Go
  ☆70Updated 2 weeks ago
• dgryski / go-hollow
  Hollow Heaps for Go
  ☆20Updated 7 years ago
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆41Updated 5 years ago
• stapelberg / goturbopfor
  Teaching implementation of the TurboPFor integer compression algorithm
  ☆23Updated 6 years ago
• mettienne / tiered-vector
  Highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of n elements supporting access in time O(…
  ☆50Updated last year
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆55Updated last year
• amallia / go-ef
  A Go implementation of the Elias-Fano encoding
  ☆40Updated last year
• demerphq / BeagleHash
  Fast 64 bit evolved hash.
  ☆34Updated 8 years ago
• t3rm1n4l / nitro-lsm
  An log structured merge tree varient of nitro storage engine
  ☆29Updated 9 years ago
• hillbig / rsdic
  A Go library for space-efficient rank/select operations for both sparse and dense bit arrays.
  ☆37Updated 5 years ago
• lemire / FastDifferentialCoding
  Fast differential coding functions (using SIMD instructions)
  ☆55Updated 8 years ago
• dgryski / go-boomphf
  Fast and scalable minimal perfect hashing for massive key sets
  ☆72Updated 5 years ago
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆36Updated 2 years ago
• WojciechMula / simd-search
  Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)
  ☆52Updated 8 years ago
• facebookincubator / go-qfext
  a fast counting quotient filter implementation in golang
  ☆96Updated 2 months ago