Alternatives and similar repositories for hyperloglog-hip

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

• iwiwi / parallel-string-radix-sort
  A parallelized implementation of optimized MSD radix sort for strings
  ☆27Updated 6 years ago
• caetanosauer / foster-btree
  A reusable, extensible, and efficient C++ implementation of the Foster B-tree data structure
  ☆15Updated 6 years ago
• HewlettPackard / foedus
  FOEDUS: Fast Optimistic Engine for Data Unification Services
  ☆66Updated 8 years ago
• thawk105 / ccbench
  Concurrency Control Benchmark
  ☆48Updated last year
• HewlettPackard / foedus_code
  FOEDUS main source code repository
  ☆63Updated 8 years ago
• sfu-dis / ermia
  ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)
  ☆90Updated 2 years ago
• spcl / vldb19-distributed-locking
  This repository hosts the code used for the following paper: Claude Barthels, Ingo Müller, Konstantin Taranov, Torsten Hoefler, Gustavo A…
  ☆10Updated 5 years ago
• caetanosauer / zero
  Fork of the Shore-MT storage manager used by the research project Instant Recovery
  ☆30Updated 6 years ago
• pramalhe / RedoDB
  The world's first wait-free KV store with generic durable linearizable transactions
  ☆41Updated 3 years ago
• stanford-futuredata / index-baselines
  Simple baselines for "Learned Indexes"
  ☆159Updated 7 years ago
• harald-lang / tree-encoded-bitmaps
  ☆38Updated 5 years ago
• rotaki / tpcc-runner
  An implementation of various in-memory concurrency control protocols
  ☆24Updated last year
• jungmair / START
  Self-Tuning Adaptive Radix Tree
  ☆27Updated 5 years ago
• koeppl / separate_chaining
  Hash table with separate chaining layout
  ☆9Updated 3 years ago
• amplab / succinct-cpp
  Succinct C++
  ☆24Updated 4 years ago
• jarulraj / n-store
  NVM Evaluation Testbed
  ☆29Updated 6 years ago
• LineairDB / LineairDB
  C++ fast transactional key-value storage.
  ☆166Updated 4 months ago
• iwiwi / parallel-radix-sort
  An implementation of optimized parallel radix sort
  ☆49Updated 6 years ago
• rmind / masstree
  Masstree -- lockless cache-aware trie of B+ trees [experimental]
  ☆100Updated 6 years ago
• mkaguilera / yesquel
  Yesquel: scalable SQL storage for Web apps
  ☆42Updated 8 years ago
• pdet / ProgressiveIndexing
  Stand-alone implementation of the progressive indexing algorithms.
  ☆16Updated 5 years ago
• peterboncz / bloomfilter-repro
  ☆29Updated 5 years ago
• kunisura / TdZdd
  A top-down/breadth-first decision diagram manipulation framework
  ☆59Updated last year
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆41Updated 5 years ago
• Cavalia / Cavalia
  A transactional main-memory database system on multicores
  ☆104Updated 6 years ago
• fast-pack / dictionary
  High-performance dictionary coding
  ☆104Updated 8 years ago
• peterboncz / bloomfilter-bsd
  based on the work of Harald Lang when at CWI
  ☆23Updated 5 years ago
• daravinds / Learned-Index-Structures
  An Implementation of Learned Indices and a Comparative Study against Traditional Index Structures
  ☆14Updated 6 years ago
• cosmoss-jigu / hydralist
  ☆29Updated 2 years ago
• huanchenz / index-microbench
  ☆15Updated 8 years ago