rahulyesantharao / b-epsilon-tree

Related projects ⓘ

Alternatives and complementary repositories for b-epsilon-tree

• pramalhe / RedoDB
  The world's first wait-free KV store with generic durable linearizable transactions
  ☆38Updated 2 years ago
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆27Updated 3 years ago
• tum-db / cachecoherence
  ☆10Updated 3 years ago
• Vanlightly / vsr-tlaplus
  TLA+ specifications related to Viewstamped Replication
  ☆28Updated last year
• IBM / uDepot
  Key-Value Store for Non-Volatile Memories uDepot
  ☆44Updated 2 years ago
• LPD-EPFL / ssmem
  ssmem is a simple object-based memory allocator with epoch-based garbage collection
  ☆34Updated 8 years ago
• lorenzhs / BuRR
  Bumped Ribbon Retrieval and Approximate Membership Query
  ☆39Updated last month
• twizzler-operating-system / twizzler-public
  Public-facing version of the Twizzler OS source code. Note: this is not completely up-to-date with internal Twizzler code.
  ☆65Updated 4 years ago
• TomerEven / Prefix-Filter
  Prefix Filter: Practically and Theoretically Better Than Bloom.
  ☆48Updated 2 years ago
• jbapple / libfilter
  High-speed Bloom filters and taffy filters for C, C++, and Java
  ☆32Updated last year
• L-v-M / async
  ☆21Updated last year
• harald-lang / tree-encoded-bitmaps
  ☆37Updated 4 years ago
• senderista / hashtable-benchmarks
  An Evaluation of Linear Probing Hashtable Algorithms
  ☆29Updated 11 months ago
• wuxb45 / wormhole
  Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)
  ☆76Updated 2 years ago
• HagarMeir / transactionLib
  Transactional Data Structure Libraries
  ☆12Updated 6 years ago
• efficient / cicada
  Dependably fast multi-core in-memory transactions
  ☆19Updated 7 years ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆55Updated last year
• futurewei-cloud / QuantaDB
  ☆14Updated last year
• cuckoo-trie / cuckoo-trie-code
  ☆51Updated 5 months ago
• rcslab / aurora
  Aurora Single Level Store
  ☆27Updated 8 months ago
• naskitis / Cache-Conscious-Data-Structures
  The array hash table, array burst trie and array BST, written in C, as described in my PhD thesis.
  ☆40Updated 7 years ago
• jandrewrogers / AquaHash
  Fast Hash Functions Using AES Intrinsics
  ☆79Updated 5 years ago
• DBOS-project / dbos-scheduler
  ☆26Updated 3 years ago
• rusnikola / lfsmr
  Hyaline Reclamation (PLDI '21, PODC '19)
  ☆19Updated 3 years ago
• cacheMon / libCacheSim
  a high performance cache simulator and library
  ☆96Updated 2 months ago
• flippingbits / cssl
  Cache-Sensitive Skip List.
  ☆22Updated 6 years ago
• jermp / interpolative_coding
  A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.
  ☆28Updated last year
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated last year
• pramalhe / CX
  A Wait-Free Universal Construct for Large Objects
  ☆96Updated 4 years ago
• kunrenyale / CalvinDB
  Geo-replicated CalvinDB(Include the original CalvinDB and low latency version)
  ☆24Updated 4 years ago