Alternatives and similar repositories for Harmonia_for_B_plus_trees

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

• billziss-gh / imap
  Integer Map Data Structure
  ☆131Updated 2 years ago
• oschonrock / binfuse
  c++ library for binary fuse filters, including a sharded filter
  ☆93Updated 7 months ago
• unum-cloud / udisk
  The fastest ACID-transactional persisted Key-Value store designed as modified LSM-Tree for NVMe block-devices with GPU-acceleration and S…
  ☆74Updated 2 years ago
• senderista / hashtable-benchmarks
  An Evaluation of Linear Probing Hashtable Algorithms
  ☆32Updated last year
• capsuleman / ssd-nvme-database
  Columnar database on SSD NVMe
  ☆14Updated 4 years ago
• eras / tlsd
  Generate (message) sequence diagrams from TLA+ state traces
  ☆74Updated 2 years ago
• MultiArrayQueue / MultiArrayQueue
  Multi-Array Queue program codes
  ☆76Updated 3 months ago
• axiomhq / zig-hyperloglog
  Zig library for HyperLogLog estimation
  ☆89Updated last year
• rtheunissen / bst
  Implementing 20+ binary search trees to compare balancing strategies
  ☆47Updated last month
• minotaur-toolkit / minotaur
  A description of Minotaur can be found in https://arxiv.org/abs/2306.00229.
  ☆111Updated last week
• damageboy / vxsort-cpp
  My very own vxsort re-implemented with "modern" C++ by a complete idiot (in C++)
  ☆30Updated last year
• xqb64 / ucc
  An optimizing compiler for a large subset of the C programming language
  ☆26Updated 3 weeks ago
• fanf2 / hg64
  a 64-bit histogram / quantile sketch
  ☆59Updated 8 months ago
• backtrace-labs / poireau
  Poireau: a sampling allocation debugger
  ☆98Updated 3 years ago
• tekknolagi / db.py
  ☆22Updated last year
• sillycross / WasmNow
  Fast WebAssembly Baseline Compiler
  ☆59Updated 2 years ago
• google / zuckerli
  ☆28Updated 2 years ago
• jermp / interpolative_coding
  A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.
  ☆30Updated 2 years ago
• mars-research / DRAMHiT
  ☆31Updated last week
• evanj / nanocollision
  NanoCollision: Experiments with collisions of nanosecond timestamps
  ☆23Updated this week
• vkrasnov / avx_qsort
  Quick sort code using AVX2 instructions
  ☆69Updated 8 years ago
• iczelia / qbdiff
  building and applying patches to binary files
  ☆74Updated last month
• pramalhe / CX
  A Wait-Free Universal Construct for Large Objects
  ☆96Updated 5 years ago
• lorenzhs / BuRR
  Bumped Ribbon Retrieval and Approximate Membership Query
  ☆48Updated 3 months ago
• danthegoodman1 / EpicEpoch
  A highly concurrent, low latency, highly available monotonic hybrid timestamp service.
  ☆22Updated 9 months ago
• pdillinger / fastfilter_cpp
  Fast Approximate Membership Filters (C++)
  ☆22Updated 4 years ago
• serge-sans-paille / i8mm
  Various implementation of byte matrix multiplication
  ☆26Updated 8 months ago
• stanford-futuredata / Uniserve
  A runtime implementation of data-parallel actors.
  ☆39Updated 3 years ago
• Keith-Cancel / k-hashv
  A vectorized single header hash function.
  ☆21Updated 10 months ago
• lemire / testingmlp
  Testing memory-level parallelism
  ☆82Updated last year