Alternatives and similar repositories for origami-sort

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

• rafaelkallis / adaptive-radix-tree
  An adaptive radix tree for efficient indexing in main memory.
  ☆163Updated last year
• harald-lang / tree-encoded-bitmaps
  ☆38Updated 5 years ago
• wuwuz / Vacuum-Filter
  ☆52Updated 9 months ago
• peterboncz / bloomfilter-repro
  ☆30Updated 6 years ago
• lorenzhs / BuRR
  Bumped Ribbon Retrieval and Approximate Membership Query
  ☆48Updated 2 months ago
• cuckoo-trie / cuckoo-trie-code
  ☆54Updated last year
• speedskater / hot
  HOT - Height Optimized Trie
  ☆155Updated 7 years ago
• FastFilter / fastfilter_cpp
  Fast Approximate Membership Filters (C++)
  ☆281Updated 2 weeks ago
• cwida / rma
  Sequential implementation of the Rewired Memory Array.
  ☆19Updated 6 years ago
• google / cuckoo-index
  Cuckoo Index: A Lightweight Secondary Index Structure
  ☆129Updated 3 years ago
• UCHI-DB / sboost
  SBoost is a SIMD-based C++ library enabling fast filtering and decoding of lightweight encoded data
  ☆11Updated 4 years ago
• TomerEven / Prefix-Filter
  Prefix Filter: Practically and Theoretically Better Than Bloom.
  ☆48Updated 3 years ago
• sfu-dis / corobase
  Coroutine-Oriented Main-Memory Database Engine (VLDB 2021)
  ☆249Updated 3 years ago
• cwida / fsst
  Fast Static Symbol Table (FSST): efficient random-access string compression
  ☆461Updated 4 months ago
• viktorleis / vmcache
  ☆72Updated 5 months ago
• tuhhosg / exmap
  ☆48Updated last year
• runshenzhu / palmtree
  An implementation of Intel's concurrent B+Tree (Palm Tree)
  ☆175Updated 9 years ago
• flode / ARTSynchronized
  ☆121Updated 3 years ago
• splatlab / vqf
  A fast approximate membership query data structure
  ☆11Updated last year
• TimoKersten / db-engine-paradigms
  Collection of experiments to carve out the differences between two types of relational query processing engines: Vectorizing (interpretat…
  ☆261Updated 7 years ago
• microsoft / pmwcas
  pmwcas
  ☆139Updated 2 years ago
• sfu-dis / bztree
  An open-source BzTree implementation
  ☆92Updated 4 years ago
• wagjamin / inkfuse
  InkFuse - An Experimental Database Runtime Unifying Vectorized and Compiled Query Execution.
  ☆52Updated last year
• aboffa / CoCo-trie
  COllapsed and COmpressed trie: a data-aware compressed string dictionary
  ☆35Updated 6 months ago
• jungmair / START
  Self-Tuning Adaptive Radix Tree
  ☆28Updated 5 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)
  ☆81Updated 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)
  ☆65Updated 4 months ago
• efficient / HOPE
  Order-preserving key encoder
  ☆124Updated 5 years ago
• UWQuickstep / quickstep
  Quickstep project
  ☆42Updated 10 months ago
• learnedsystems / RadixSpline
  A Single-Pass Learned Index
  ☆133Updated 2 years ago