Alternatives and similar repositories for LearnedSort

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

• learnedsystems / RMI
  The recursive model index, a learned index structure
  ☆225Updated 3 years ago
• learnedsystems / SOSD
  A Benchmark for Learned Indexes
  ☆289Updated 3 years ago
• stanford-futuredata / index-baselines
  Simple baselines for "Learned Indexes"
  ☆159Updated 7 years ago
• mikebenfield / Learned-Index-Structures
  Learned Index Structures
  ☆50Updated 6 years ago
• 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?"
  ☆19Updated 4 years ago
• cuckoo-trie / cuckoo-trie-code
  ☆54Updated last year
• harald-lang / tree-encoded-bitmaps
  ☆38Updated 5 years ago
• speedskater / hot
  HOT - Height Optimized Trie
  ☆156Updated 7 years ago
• jungmair / START
  Self-Tuning Adaptive Radix Tree
  ☆28Updated 5 years ago
• mutable-org / mutable
  A Database System for Research and Fast Prototyping
  ☆106Updated 3 weeks ago
• learnedsystems / LearnedSecondaryIndex
  A read-optimized learned index for unsorted data
  ☆31Updated 2 years ago
• learnedsystems / RadixSpline
  A Single-Pass Learned Index
  ☆133Updated 2 years ago
• cmuparlay / PAM
  Parallel Balanced Binary Tree Structures
  ☆118Updated 6 months ago
• epfl-dias / proteus
  Proteus is a database engine (research prototype) designed for today's heterogeneous environments. Proteus adapts to variable data, hardw…
  ☆25Updated last year
• bcaine / learned_indices
  A C++11 implementation of the B-Tree part of "The Case for Learned Index Structures"
  ☆81Updated 7 years ago
• UWQuickstep / quickstep
  Quickstep project
  ☆42Updated 10 months ago
• viktorleis / perfevent
  An easy-to-use, header-only C++ wrapper for Linux' perf event API
  ☆129Updated 6 months ago
• viktorleis / vmcache
  ☆72Updated last week
• wangziqi2016 / index-microbench
  ☆150Updated 2 years ago
• rafaelkallis / adaptive-radix-tree
  An adaptive radix tree for efficient indexing in main memory.
  ☆163Updated last year
• cmuparlay / ParlayANN
  A library of algorithms for approximate nearest neighbor search in high dimensions, along with a set of useful tools for designing such a…
  ☆158Updated this week
• flode / ARTSynchronized
  ☆121Updated 3 years ago
• sfu-dis / mosaicdb
  The Art of Latency Hiding in Modern Database Engines (VLDB 2024)
  ☆60Updated 4 months ago
• peterboncz / bloomfilter-repro
  ☆30Updated 6 years ago
• yxymit / Sundial
  Sundial: A distributed OLTP database testbed.
  ☆38Updated 4 years ago
• yingjunwu / IndexZoo
  Benchmarking In-Memory Index Structures
  ☆26Updated 6 years ago
• cwida / PDX
  ⚡ Faster similarity search with PDX: A vertical data layout for vectors
  ☆55Updated 2 weeks ago
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆29Updated 4 years ago
• cornelldbgroup / skinnerdb
  SkinnerDB is an analytical database management system. It uses adaptive processing and reinforcement learning to find near-optimal join o…
  ☆50Updated last year
• tum-db / user-defined-operators
  Implementation and artifacts for "User-Defined Operators: Efficiently Integrating Custom Algorithms into Modern Databases"
  ☆24Updated last year