Alternatives and similar repositories for RadixSpline

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

• efficient / HOPE
  Order-preserving key encoder
  ☆123Updated 5 years ago
• learnedsystems / SOSD
  A Benchmark for Learned Indexes
  ☆287Updated 3 years ago
• learnedsystems / RMI
  The recursive model index, a learned index structure
  ☆223Updated 3 years ago
• speedskater / hot
  HOT - Height Optimized Trie
  ☆156Updated 7 years ago
• DataManagementLab / ScaleStore
  This is the source code for our (Tobias Ziegler, Carsten Binnig and Viktor Leis) published paper at SIGMOD’22: ScaleStore: A Fast and Cos…
  ☆124Updated 9 months ago
• learnedsystems / LearnedSecondaryIndex
  A read-optimized learned index for unsorted data
  ☆31Updated last year
• stanford-futuredata / index-baselines
  Simple baselines for "Learned Indexes"
  ☆159Updated 7 years ago
• viktorleis / vmcache
  ☆72Updated 4 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)
  ☆80Updated 3 years ago
• flode / ARTSynchronized
  ☆121Updated 3 years ago
• wangziqi2016 / index-microbench
  ☆149Updated 2 years ago
• yxymit / DBx1000
  ☆290Updated 2 years ago
• mutable-org / mutable
  A Database System for Research and Fast Prototyping
  ☆106Updated 2 months ago
• anikristo / LearnedSort
  Learned Sort: a model-enhanced sorting algorithm
  ☆81Updated 3 years ago
• yxymit / Sundial
  Sundial: A distributed OLTP database testbed.
  ☆38Updated 4 years ago
• harald-lang / tree-encoded-bitmaps
  ☆38Updated 5 years ago
• cuckoo-trie / cuckoo-trie-code
  ☆54Updated last year
• jungmair / START
  Self-Tuning Adaptive Radix Tree
  ☆27Updated 5 years ago
• mitdbg / deneva
  Deneva is a distributed in-memory database framework that supports the evaluation of various concurrency control algorithms.
  ☆117Updated 2 years ago
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆29Updated 4 years ago
• TimoKersten / db-engine-paradigms
  Collection of experiments to carve out the differences between two types of relational query processing engines: Vectorizing (interpretat…
  ☆260Updated 7 years ago
• sfu-dis / ermia
  ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)
  ☆91Updated 2 years ago
• leanstore / leanstore
  ☆559Updated last month
• Jiacheng-WU / lipp
  Updatable Learned Index with Precise Positions
  ☆59Updated 3 years ago
• google / cuckoo-index
  Cuckoo Index: A Lightweight Secondary Index Structure
  ☆129Updated 3 years ago
• sfu-dis / bztree
  An open-source BzTree implementation
  ☆92Updated 4 years ago
• tuhhosg / exmap
  ☆48Updated last year
• gvinciguerra / PGM-index
  🏅State-of-the-art learned data structure that enables fast lookup, predecessor, range searches and updates in arrays of billions of item…
  ☆821Updated 8 months ago
• sfu-dis / pibench
  Benchmarking framework for index structures on persistent memory
  ☆88Updated 2 years ago
• rafaelkallis / adaptive-radix-tree
  An adaptive radix tree for efficient indexing in main memory.
  ☆162Updated last year