Alternatives and similar repositories for origami-sort

Users that are interested in origami-sort are comparing it to the libraries listed below

• harald-lang / tree-encoded-bitmaps
  ☆38Updated 4 years ago
• cuckoo-trie / cuckoo-trie-code
  ☆53Updated last year
• rafaelkallis / adaptive-radix-tree
  An adaptive radix tree for efficient indexing in main memory.
  ☆161Updated last year
• TomerEven / Prefix-Filter
  Prefix Filter: Practically and Theoretically Better Than Bloom.
  ☆48Updated 2 years ago
• fzqneo / ByteSlice
  "Byteslice: Pushing the envelop of main memory data processing with a new storage layout" (SIGMOD'15)
  ☆25Updated 6 years ago
• wuwuz / Vacuum-Filter
  ☆51Updated 6 months ago
• peterboncz / bloomfilter-repro
  ☆29Updated 5 years ago
• jbapple / libfilter
  High-speed Bloom filters and taffy filters for C, C++, and Java
  ☆35Updated last year
• speedskater / hot
  HOT - Height Optimized Trie
  ☆150Updated 7 years ago
• UCHI-DB / sboost
  SBoost is a SIMD-based C++ library enabling fast filtering and decoding of lightweight encoded data
  ☆11Updated 3 years ago
• sfu-dis / corobase
  Coroutine-Oriented Main-Memory Database Engine (VLDB 2021)
  ☆249Updated 3 years ago
• sfu-dis / bztree
  An open-source BzTree implementation
  ☆92Updated 3 years ago
• flode / BwTree
  Implementation of the BwTree as specified by Microsoft Research
  ☆100Updated 9 years ago
• efficient / HOPE
  Order-preserving key encoder
  ☆122Updated 5 years ago
• lorenzhs / BuRR
  Bumped Ribbon Retrieval and Approximate Membership Query
  ☆44Updated 2 weeks ago
• microsoft / pmwcas
  pmwcas
  ☆138Updated 2 years ago
• sfu-dis / mosaicdb
  The Art of Latency Hiding in Modern Database Engines (VLDB 2024)
  ☆58Updated last month
• TimoKersten / db-engine-paradigms
  Collection of experiments to carve out the differences between two types of relational query processing engines: Vectorizing (interpretat…
  ☆256Updated 6 years ago
• wagjamin / inkfuse
  InkFuse - An Experimental Database Runtime Unifying Vectorized and Compiled Query Execution.
  ☆48Updated last year
• FastFilter / fastfilter_cpp
  Fast Approximate Membership Filters (C++)
  ☆278Updated 5 months ago
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆29Updated 4 years ago
• wuxb45 / wormhole
  Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)
  ☆79Updated 3 years ago
• sfu-dis / preemptdb
  Low-Latency Transaction Scheduling via Userspace Interrupts: Why Wait or Yield When You Can Preempt? (SIGMOD 2025 Best Paper Award)
  ☆55Updated last month
• splatlab / vqf
  A fast approximate membership query data structure
  ☆11Updated 10 months ago
• flode / ARTSynchronized
  ☆119Updated 3 years ago
• L-v-M / async
  ☆20Updated 2 years ago
• yingjunwu / IndexZoo
  Benchmarking In-Memory Index Structures
  ☆26Updated 6 years ago
• MorphStore / Engine
  ☆14Updated last year
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆41Updated 5 years ago
• fast-pack / dictionary
  High-performance dictionary coding
  ☆104Updated 8 years ago