Alternatives and similar repositories for hyperloglog-hip

Users that are interested in hyperloglog-hip are comparing it to the libraries listed below

• HewlettPackard / foedus
  FOEDUS: Fast Optimistic Engine for Data Unification Services
  ☆65Updated 8 years ago
• HewlettPackard / foedus_code
  FOEDUS main source code repository
  ☆64Updated 8 years ago
• thawk105 / ccbench
  Concurrency Control Benchmark
  ☆48Updated 2 years ago
• sfu-dis / ermia
  ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)
  ☆92Updated 2 years ago
• iwiwi / parallel-string-radix-sort
  A parallelized implementation of optimized MSD radix sort for strings
  ☆27Updated 7 years ago
• LineairDB / LineairDB
  C++ fast transactional key-value storage.
  ☆173Updated last week
• caetanosauer / foster-btree
  A reusable, extensible, and efficient C++ implementation of the Foster B-tree data structure
  ☆15Updated 6 years ago
• stanford-futuredata / index-baselines
  Simple baselines for "Learned Indexes"
  ☆159Updated 7 years ago
• caetanosauer / zero
  Fork of the Shore-MT storage manager used by the research project Instant Recovery
  ☆31Updated 7 years ago
• rotaki / tpcc-runner
  An implementation of various in-memory concurrency control protocols
  ☆26Updated last year
• rmind / masstree
  Masstree -- lockless cache-aware trie of B+ trees [experimental]
  ☆100Updated 7 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…
  ☆181Updated 7 years ago
• wuxb45 / wormhole
  Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)
  ☆83Updated 3 years ago
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆41Updated 5 years ago
• efficient / cicada-engine
  The Cicada engine
  ☆59Updated 8 years ago
• Cavalia / Cavalia
  A transactional main-memory database system on multicores
  ☆105Updated 7 years ago
• runshenzhu / palmtree
  An implementation of Intel's concurrent B+Tree (Palm Tree)
  ☆176Updated 9 years ago
• kohler / masstree-beta
  Beta release of Masstree.
  ☆447Updated 2 years ago
• jermp / opt_vbyte
  Optimal partitioning of Variable-Byte codes for better compression and fast decoding.
  ☆17Updated 4 years ago
• microsoft / pmwcas
  pmwcas
  ☆139Updated 2 years ago
• aboffa / CoCo-trie
  COllapsed and COmpressed trie: a data-aware compressed string dictionary
  ☆36Updated 9 months ago
• flode / BwTree
  Implementation of the BwTree as specified by Microsoft Research
  ☆99Updated 9 years ago
• wangziqi2016 / index-microbench
  ☆151Updated 2 years ago
• kampersanda / poplar-trie
  C++17 implementation of memory-efficient dynamic tries
  ☆58Updated 3 years ago
• efficient / mica
  MICA: A Fast In-memory Key-Value Store (see isca2015 branch for the ISCA2015 version)
  ☆211Updated 9 years ago
• pramalhe / RedoDB
  The world's first wait-free KV store with generic durable linearizable transactions
  ☆41Updated 3 years ago
• stephentu / silo
  Multicore in-memory storage engine
  ☆395Updated 8 years ago
• google / cuckoo-index
  Cuckoo Index: A Lightweight Secondary Index Structure
  ☆129Updated 3 years ago
• wuxb45 / lsm-trie
  LSM-trie
  ☆114Updated 4 years ago
• JLockerman / FuzzyLog
  Experiments in partially ordered SMR.
  ☆48Updated 4 years ago