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
  ☆48Updated last year
• HewlettPackard / foedus_code
  FOEDUS main source code repository
  ☆63Updated 7 years ago
• caetanosauer / foster-btree
  A reusable, extensible, and efficient C++ implementation of the Foster B-tree data structure
  ☆15Updated 5 years ago
• aboffa / CoCo-trie
  COllapsed and COmpressed trie: a data-aware compressed string dictionary
  ☆34Updated 3 months ago
• sfu-dis / ermia
  ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)
  ☆90Updated 2 years ago
• xerial / jnuma
  A Java library for accessing NUMA (Non Uniform Memory Access) API
  ☆17Updated 12 years ago
• HewlettPackard / foedus
  FOEDUS: Fast Optimistic Engine for Data Unification Services
  ☆66Updated 8 years ago
• iwiwi / parallel-string-radix-sort
  A parallelized implementation of optimized MSD radix sort for strings
  ☆27Updated 6 years ago
• caetanosauer / zero
  Fork of the Shore-MT storage manager used by the research project Instant Recovery
  ☆30Updated 6 years ago
• jungmair / START
  Self-Tuning Adaptive Radix Tree
  ☆27Updated 5 years ago
• pdet / ProgressiveIndexing
  Stand-alone implementation of the progressive indexing algorithms.
  ☆16Updated 5 years ago
• daravinds / Learned-Index-Structures
  An Implementation of Learned Indices and a Comparative Study against Traditional Index Structures
  ☆14Updated 6 years ago
• peterboncz / bloomfilter-bsd
  based on the work of Harald Lang when at CWI
  ☆23Updated 5 years ago
• gvinciguerra / BlockEpsilonTree
  🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.
  ☆11Updated 2 years ago
• amplab / succinct-cpp
  Succinct C++
  ☆24Updated 4 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
• koeppl / separate_chaining
  Hash table with separate chaining layout
  ☆9Updated 3 years ago
• JLockerman / FuzzyLog
  Experiments in partially ordered SMR.
  ☆48Updated 4 years ago
• flode / BwTree
  Implementation of the BwTree as specified by Microsoft Research
  ☆100Updated 9 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 2 months ago
• hillbig / tx-trie
  Automatically exported from code.google.com/p/tx-trie
  ☆29Updated 9 years ago
• kampersanda / poplar-trie
  C++17 implementation of memory-efficient dynamic tries
  ☆58Updated 3 years ago
• cwida / rma
  Sequential implementation of the Rewired Memory Array.
  ☆19Updated 6 years ago
• rotaki / tpcc-runner
  An implementation of various in-memory concurrency control protocols
  ☆24Updated last year
• harald-lang / tree-encoded-bitmaps
  ☆38Updated 4 years ago
• cuckoo-trie / cuckoo-trie-code
  ☆53Updated last year
• Poyias / mBonsai
  Compact Tree Representation
  ☆16Updated 8 years ago
• lsidir / imprints
  simd enabled column imprints
  ☆11Updated 7 years ago
• tum-db / partitioned-filters
  A four-dimensional Analysis of Partitioned Approximate Filters
  ☆10Updated 2 years ago