wolfgarbe / EliasFanoCompression

Related projects: ⓘ

• jandrewrogers / AquaHash
  Fast Hash Functions Using AES Intrinsics
  ☆79Updated 5 years ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆55Updated last year
• AntonioFerrandez / MergedTrie
  MergedTrie code
  ☆12Updated 4 years ago
• fwessels / simdcsv
  ☆35Updated 3 years ago
• splatlab / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆15Updated 6 years ago
• jermp / clustered_elias_fano_indexes
  Clustered Elias-Fano inverted indexes.
  ☆14Updated 6 years ago
• malbrain / HatTrie
  A compact implementation of Dr. Askitis HatTrie
  ☆80Updated 10 years ago
• migumar2 / libCSD
  C++ Library implementing Compressed String Dictionaries
  ☆45Updated 2 years ago
• jsnell / parallel-xxhash
  Compute xxHash hash codes for 8 keys in parallel
  ☆46Updated 5 years ago
• jermp / interpolative_coding
  A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.
  ☆28Updated last year
• rurban / perl-hash-stats
  Counting the collisions with perl hash tables per function
  ☆12Updated 5 years ago
• wangyi-fudan / wyHLL
  The dream accurate approximate set cardinality estimator based on 3-bit HyperLogLog. More accurate than Redis HyperLogLog.
  ☆55Updated 3 years ago
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆38Updated 4 years ago
• cruppstahl / libvbyte
  A fast implementation for varbyte 32bit/64bit integer compression
  ☆114Updated 7 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(…
  ☆49Updated 5 months ago
• s-yata / marisa2
  ☆10Updated this week
• damageboy / vxsort-cpp
  My very own vxsort re-implemented with "modern" C++ by a complete idiot (in C++)
  ☆30Updated 10 months ago
• jermp / s_indexes
  Universe-sliced indexes in C++.
  ☆17Updated last year
• lemire / dictionary
  High-performance dictionary coding
  ☆102Updated 7 years ago
• patmorin / arraylayout
  Experiments with array layouts for comparison-based searching
  ☆80Updated 8 months ago
• microsoft / FishStore
  FishStore is a prototype fast ingestion and querying layer for flexible-schema data
  ☆215Updated last year
• pascaldekloe / flit
  fixed-length integer trim
  ☆32Updated last year
• migumar2 / uiHRDC
  Suite of universal indexes for Highly Repetitive Document Collections
  ☆19Updated 4 years ago
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆52Updated 8 months ago
• lemire / MaskedVByte
  Fast decoder for VByte-compressed integers
  ☆115Updated 4 months ago
• geofflangdale / smh
  Shuffle-based predicate matcher and all-round branch free swiss army chainsaw
  ☆16Updated 6 years ago
• mklarqvist / StormBitmaps
  Fast algorithms for computing XX^T for binary matrices
  ☆14Updated 4 years ago
• ot / semi_index
  Implementation of the JSON semi-index described in the paper "Semi-Indexing Semi-Structured Data in Tiny Space"
  ☆57Updated 11 years ago
• fclaude / libcds2
  Compact Data Structures Library
  ☆97Updated 2 years ago
• ot / emphf
  An efficient external-memory algorithm for the construction of minimal perfect hash functions
  ☆61Updated 3 months ago