Alternatives and similar repositories for libcount

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

• hideo55 / cpp-HyperLogLog
  C++ implementation of HyperLogLog
  ☆61Updated last year
• malbrain / Btree-source-code
  A working project for High-concurrency B-tree source code in C
  ☆252Updated 5 years ago
• LPD-EPFL / ASCYLIB
  ASCYLIB (with OPTIK) is a concurrent-search data-structure library with over 40 implementantions of linked lists, hash tables, skip lists…
  ☆182Updated 8 years ago
• stanford-futuredata / index-baselines
  Simple baselines for "Learned Indexes"
  ☆159Updated 8 years ago
• sears / bLSM
  Read- and latency-optimized log structured merge tree
  ☆175Updated 13 years ago
• google / cuckoo-index
  Cuckoo Index: A Lightweight Secondary Index Structure
  ☆129Updated 4 years ago
• rmind / libqsbr
  QSBR and EBR library
  ☆135Updated 6 years ago
• TooBiased / growt
  This is a header only library offering a variety of dynamically growing concurrent hash tables. That all work by dynamically migrating th…
  ☆117Updated last year
• bingmann / stx-btree
  OBSOLETE, contained in https://github.com/tlx/tlx - STX B+ Tree C++ Template Classes -
  ☆215Updated 2 years ago
• fredrikwidlund / hash-function-benchmark
  Benchmark of common hash functions
  ☆37Updated 6 years ago
• jarulraj / postgresql-cpp
  C++11 port of the PostgreSQL DBMS
  ☆70Updated 9 years ago
• rmind / masstree
  Masstree -- lockless cache-aware trie of B+ trees [experimental]
  ☆100Updated 7 years ago
• RyanMarcus / HortonHashing
  An implementation of Horton hash tables
  ☆10Updated 9 years ago
• ot / ds2i
  A library of inverted index data structures
  ☆151Updated 3 years ago
• fast-pack / SIMDCompressionAndIntersection
  A C++ library to compress and intersect sorted lists of integers using SIMD instructions
  ☆443Updated 6 months ago
• jiecchen / StreamingCC
  A C++ library for summarizing data streams
  ☆23Updated 6 years ago
• runshenzhu / palmtree
  An implementation of Intel's concurrent B+Tree (Palm Tree)
  ☆176Updated 9 years ago
• rafaelkallis / adaptive-radix-tree
  An adaptive radix tree for efficient indexing in main memory.
  ☆170Updated 2 months ago
• cksystemsgroup / scal
  High-performance multicore-scalable data structures and benchmarks
  ☆144Updated 6 years ago
• sengelha / streaming-percentiles
  Cross-platform, multi-language implementation of multiple streaming percentile algorithms
  ☆65Updated 2 years ago
• diegocaro / cpp-btree
  A clone of Google C++ B-tree code https://code.google.com/p/cpp-btree/
  ☆87Updated 11 years ago
• wuxb45 / lsm-trie
  LSM-trie
  ☆114Updated 4 years ago
• OrangeTide / btree
  lock free modified prefix B+tree append-only database
  ☆116Updated 10 years ago
• CountOnes / hamming_weight
  C library to compute the Hamming weight of arrays
  ☆51Updated 7 years ago
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆41Updated 6 years ago
• eourcs / LockFreeCuckooHash
  A fully concurrent lock-free cuckoo hash table implementation
  ☆56Updated 8 years ago
• pramalhe / OneFile
  The world's first wait-free Software Transactional Memory
  ☆175Updated 5 years ago
• cmuparlay / PAM
  Parallel Balanced Binary Tree Structures
  ☆122Updated 10 months ago
• vedantk / quotient-filter
  a quotient filter written in C
  ☆88Updated 8 years ago
• silt / silt
  SILT: A Memory-Efficient, High-Performance Key-Value Store
  ☆178Updated 3 years ago