Alternatives and similar repositories for LearnedSort

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

• learnedsystems / SOSD
  A Benchmark for Learned Indexes
  ☆297Updated 3 years ago
• learnedsystems / RMI
  The recursive model index, a learned index structure
  ☆229Updated 2 months ago
• cmuparlay / PAM
  Parallel Balanced Binary Tree Structures
  ☆121Updated 9 months ago
• cuckoo-trie / cuckoo-trie-code
  ☆56Updated last year
• mutable-org / mutable
  A Database System for Research and Fast Prototyping
  ☆112Updated last month
• viktorleis / vmcache
  ☆80Updated 4 months ago
• stanford-futuredata / index-baselines
  Simple baselines for "Learned Indexes"
  ☆159Updated 7 years ago
• mikebenfield / Learned-Index-Structures
  Learned Index Structures
  ☆52Updated 7 years ago
• UWQuickstep / quickstep
  Quickstep project
  ☆44Updated last year
• learnedsystems / RadixSpline
  A Single-Pass Learned Index
  ☆135Updated 2 years ago
• speedskater / hot
  HOT - Height Optimized Trie
  ☆158Updated 7 years ago
• viktorleis / perfevent
  An easy-to-use, header-only C++ wrapper for Linux' perf event API
  ☆137Updated this week
• learnedsystems / LearnedSecondaryIndex
  A read-optimized learned index for unsorted data
  ☆32Updated 2 years ago
• jungmair / START
  Self-Tuning Adaptive Radix Tree
  ☆30Updated 5 years ago
• rafaelkallis / adaptive-radix-tree
  An adaptive radix tree for efficient indexing in main memory.
  ☆167Updated last month
• dsg-uwaterloo / graphsurge
  Graphs analytics on collections of views!
  ☆37Updated 2 years ago
• harald-lang / tree-encoded-bitmaps
  ☆39Updated 5 years ago
• yingjunwu / IndexZoo
  Benchmarking In-Memory Index Structures
  ☆26Updated 6 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)
  ☆83Updated 3 years ago
• wangziqi2016 / index-microbench
  ☆151Updated 2 years ago
• the-data-lab / GraphOne
  "GraphOne: A Data Store for Real-time Analytics on Evolving Graphs", Usenix FAST'19
  ☆60Updated 5 years ago
• bcaine / learned_indices
  A C++11 implementation of the B-Tree part of "The Case for Learned Index Structures"
  ☆81Updated 8 years ago
• yxymit / Sundial
  Sundial: A distributed OLTP database testbed.
  ☆38Updated 5 years ago
• tum-db / user-defined-operators
  Implementation and artifacts for "User-Defined Operators: Efficiently Integrating Custom Algorithms into Modern Databases"
  ☆24Updated last year
• flode / ARTSynchronized
  ☆125Updated 3 years ago
• efficient / HOPE
  Order-preserving key encoder
  ☆127Updated 5 years ago
• cwida / rma
  Sequential implementation of the Rewired Memory Array.
  ☆19Updated 6 years ago
• umbra-db / diamond-vldb2024
  Reproducibility package for "Robust Join Processing with Diamond Hardened Joins"
  ☆12Updated last year
• gvinciguerra / Learned-indexes-effectiveness
  Code for the TCS paper "On the performance of learned data structures" and the ICML paper "Why are learned indexes so effective?"
  ☆21Updated 4 years ago
• peterboncz / bloomfilter-repro
  ☆30Updated 6 years ago