Alternatives and similar repositories for hyperloglog-hip:

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

• thawk105 / ccbench
  Concurrency Control Benchmark
  ☆47Updated last year
• HewlettPackard / foedus_code
  FOEDUS main source code repository
  ☆64Updated 7 years ago
• HewlettPackard / foedus
  FOEDUS: Fast Optimistic Engine for Data Unification Services
  ☆66Updated 7 years ago
• amplab / succinct-cpp
  Succinct C++
  ☆24Updated 4 years ago
• caetanosauer / foster-btree
  A reusable, extensible, and efficient C++ implementation of the Foster B-tree data structure
  ☆15Updated 5 years ago
• rotaki / tpcc-runner
  An implementation of various in-memory concurrency control protocols
  ☆24Updated last year
• iwiwi / parallel-string-radix-sort
  A parallelized implementation of optimized MSD radix sort for strings
  ☆27Updated 6 years ago
• stanford-futuredata / index-baselines
  Simple baselines for "Learned Indexes"
  ☆159Updated 7 years ago
• sfu-dis / ermia
  ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)
  ☆88Updated 2 years ago
• efficient / cicada-engine
  The Cicada engine
  ☆55Updated 7 years ago
• iwiwi / parallel-radix-sort
  An implementation of optimized parallel radix sort
  ☆49Updated 6 years ago
• Poyias / mBonsai
  Compact Tree Representation
  ☆16Updated 8 years ago
• flode / BwTree
  Implementation of the BwTree as specified by Microsoft Research
  ☆100Updated 8 years ago
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆41Updated 5 years ago
• pdet / ProgressiveIndexing
  Stand-alone implementation of the progressive indexing algorithms.
  ☆16Updated 4 years ago
• daravinds / Learned-Index-Structures
  An Implementation of Learned Indices and a Comparative Study against Traditional Index Structures
  ☆14Updated 6 years ago
• xerial / jnuma
  A Java library for accessing NUMA (Non Uniform Memory Access) API
  ☆17Updated 12 years ago
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆54Updated last year
• koeppl / separate_chaining
  Hash table with separate chaining layout
  ☆9Updated 3 years ago
• maropu / integer_encoding_library
  An encoder/decoder collection for a sequence of integers
  ☆32Updated 12 years ago
• hillbig / tx-trie
  Automatically exported from code.google.com/p/tx-trie
  ☆29Updated 9 years ago
• kunisura / TdZdd
  A top-down/breadth-first decision diagram manipulation framework
  ☆58Updated last year
• caetanosauer / zero
  Fork of the Shore-MT storage manager used by the research project Instant Recovery
  ☆29Updated 6 years ago
• wuxb45 / lsm-trie
  LSM-trie
  ☆113Updated 4 years ago
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆29Updated 3 years ago
• yingjunwu / IndexZoo
  Benchmarking In-Memory Index Structures
  ☆26Updated 6 years ago
• mkaguilera / yesquel
  Yesquel: scalable SQL storage for Web apps
  ☆42Updated 7 years ago
• yahoojapan / yosegi
  Yosegi is a Schema-less columnar storage format. Provide flexible representation like JSON and efficient reading similar to other columna…
  ☆71Updated this week
• rmind / masstree
  Masstree -- lockless cache-aware trie of B+ trees [experimental]
  ☆100Updated 6 years ago
• cuckoo-trie / cuckoo-trie-code
  ☆53Updated 10 months ago