Alternatives and similar repositories for b-epsilon-tree:

Users that are interested in b-epsilon-tree are comparing it to the libraries listed below

• lorenzhs / BuRR
  Bumped Ribbon Retrieval and Approximate Membership Query
  ☆41Updated last week
• pramalhe / RedoDB
  The world's first wait-free KV store with generic durable linearizable transactions
  ☆40Updated 3 years ago
• kunrenyale / CalvinDB
  Geo-replicated CalvinDB(Include the original CalvinDB and low latency version)
  ☆25Updated 5 years ago
• jbapple / libfilter
  High-speed Bloom filters and taffy filters for C, C++, and Java
  ☆35Updated last year
• jermp / interpolative_coding
  A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.
  ☆29Updated 2 years ago
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆29Updated 3 years ago
• aboffa / CoCo-trie
  COllapsed and COmpressed trie: a data-aware compressed string dictionary
  ☆33Updated 3 weeks ago
• harald-lang / tree-encoded-bitmaps
  ☆37Updated 4 years ago
• wuwuz / Vacuum-Filter
  ☆50Updated 3 months ago
• dominikkempa / zip-tree
  C++ Implementation of Zip Trees
  ☆14Updated 2 years ago
• Vanlightly / vsr-tlaplus
  TLA+ specifications related to Viewstamped Replication
  ☆32Updated 2 years ago
• caetanosauer / fineline-zero
  ☆12Updated 6 years ago
• TomerEven / Prefix-Filter
  Prefix Filter: Practically and Theoretically Better Than Bloom.
  ☆48Updated 2 years ago
• L-v-M / async
  ☆20Updated 2 years ago
• jermp / opt_vbyte
  Optimal partitioning of Variable-Byte codes for better compression and fast decoding.
  ☆17Updated 3 years ago
• giannitedesco / cola
  Cache Oblivious Lookahead Arrays
  ☆27Updated 11 years ago
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated 2 years ago
• dotnwat / awesome-seastar
  A curated list of resources related to Seastar, an industrial-grade C++ framework for building high-performance servers.
  ☆104Updated 6 months ago
• jermp / s_indexes
  Universe-sliced indexes in C++.
  ☆18Updated 2 years ago
• umd-dslam / SLOG
  SLOG: Serializable, Low-latency, Geo-replicated Transactions
  ☆43Updated last year
• tum-db / cachecoherence
  ☆10Updated 3 years ago
• gvinciguerra / BlockEpsilonTree
  🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.
  ☆11Updated 2 years ago
• futurewei-cloud / QuantaDB
  ☆14Updated last year
• LPD-EPFL / ssmem
  ssmem is a simple object-based memory allocator with epoch-based garbage collection
  ☆34Updated 8 years ago
• tuhhosg / exmap
  ☆41Updated 11 months ago
• pramalhe / CX
  A Wait-Free Universal Construct for Large Objects
  ☆96Updated 5 years ago
• DBOS-project / dbos-scheduler
  ☆27Updated 3 years ago
• viktorleis / mmapbench
  ☆135Updated 2 years ago
• oscarlab / Be-Tree
  A simple, reference implementation of a B^e-tree
  ☆152Updated 5 years ago
• stasis / stasis
  Stasis is a flexible transactional storage library that is geared toward high-performance applications and system developers. It supports…
  ☆53Updated 12 years ago