Alternatives and similar repositories for diskhash

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

• ot / emphf
  An efficient external-memory algorithm for the construction of minimal perfect hash functions
  ☆63Updated last year
• rizkg / BBHash
  Bloom-filter based minimal perfect hash function library
  ☆262Updated 2 years ago
• dcjones / hat-trie
  An efficient trie implementation.
  ☆255Updated 4 years ago
• splatlab / cqf
  A General-Purpose Counting Filter: Counting Quotient Filter
  ☆127Updated last year
• hideo55 / cpp-HyperLogLog
  C++ implementation of HyperLogLog
  ☆58Updated last year
• wuxb45 / lsm-trie
  LSM-trie
  ☆114Updated 4 years ago
• mpetri / FM-Index
  FM-Index full-text index implementation using RRR Wavelet trees (libcds) and fast suffix sorting (libdivsufsort) including experimental r…
  ☆107Updated 10 years ago
• lemire / FastDifferentialCoding
  Fast differential coding functions (using SIMD instructions)
  ☆53Updated 7 years ago
• cruppstahl / libvbyte
  A fast implementation for varbyte 32bit/64bit integer compression
  ☆118Updated 8 years ago
• google / cuckoo-index
  Cuckoo Index: A Lightweight Secondary Index Structure
  ☆129Updated 3 years ago
• Legacy25 / ValkyrieDB
  A SQL-to-native-code compiler based on LLVM
  ☆48Updated 9 years ago
• runshenzhu / palmtree
  An implementation of Intel's concurrent B+Tree (Palm Tree)
  ☆174Updated 8 years ago
• simdhash / clhash
  C library implementing the ridiculously fast CLHash hashing function
  ☆278Updated last year
• FastFilter / xor_singleheader
  Header-only binary fuse and xor filter library
  ☆365Updated 4 months ago
• lemire / rollinghashcpp
  Rolling Hash C++ Library
  ☆187Updated last year
• ot / succinct
  A collection of succinct data structures
  ☆202Updated last year
• fclaude / libcds
  Compact Data Structures Library
  ☆126Updated 10 years ago
• fast-pack / MaskedVByte
  Fast decoder for VByte-compressed integers
  ☆122Updated last year
• CountOnes / hamming_weight
  C library to compute the Hamming weight of arrays
  ☆46Updated 6 years ago
• dnbaker / sketch
  C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings
  ☆153Updated 10 months ago
• vedantk / quotient-filter
  a quotient filter written in C
  ☆84Updated 7 years ago
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆54Updated last year
• fast-pack / dictionary
  High-performance dictionary coding
  ☆104Updated 8 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
• FastFilter / fastfilter_cpp
  Fast Approximate Membership Filters (C++)
  ☆278Updated 5 months ago
• simongog / sdsl
  Succinct Data Structure Library
  ☆106Updated 11 years ago
• sears / bLSM
  Read- and latency-optimized log structured merge tree
  ☆174Updated 13 years ago
• silt / silt
  SILT: A Memory-Efficient, High-Performance Key-Value Store
  ☆177Updated 3 years ago
• malbrain / Btree-source-code
  A working project for High-concurrency B-tree source code in C
  ☆250Updated 4 years ago
• speedskater / hot
  HOT - Height Optimized Trie
  ☆151Updated 7 years ago