Alternatives and similar repositories for START

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

• speedskater / hot
  HOT - Height Optimized Trie
  ☆156Updated 7 years ago
• cuckoo-trie / cuckoo-trie-code
  ☆54Updated last year
• tum-db / partitioned-filters
  A four-dimensional Analysis of Partitioned Approximate Filters
  ☆11Updated 2 years ago
• viktorleis / vmcache
  ☆72Updated 4 months ago
• tuhhosg / exmap
  ☆48Updated last year
• cosmoss-jigu / hydralist
  ☆29Updated 2 years ago
• harald-lang / tree-encoded-bitmaps
  ☆38Updated 5 years ago
• yingjunwu / IndexZoo
  Benchmarking In-Memory Index Structures
  ☆26Updated 6 years ago
• learnedsystems / LearnedSecondaryIndex
  A read-optimized learned index for unsorted data
  ☆31Updated last year
• flode / ARTSynchronized
  ☆121Updated 3 years ago
• hpides / vectorized-hash-tables
  Code and results for our paper "Analyzing Vectorized Hash Tables Across CPU Architectures" @ VLDB '23.
  ☆25Updated last year
• UWQuickstep / quickstep
  Quickstep project
  ☆42Updated 8 months ago
• TU-Berlin-DIMA / Hawk-VLDBJ
  ☆15Updated 5 years ago
• wangziqi2016 / index-microbench
  ☆149Updated 2 years ago
• sfu-dis / bztree
  An open-source BzTree implementation
  ☆92Updated 4 years ago
• sfu-dis / ermia
  ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)
  ☆91Updated 2 years ago
• sfu-dis / mosaicdb
  The Art of Latency Hiding in Modern Database Engines (VLDB 2024)
  ☆59Updated 3 months ago
• flode / BwTree
  Implementation of the BwTree as specified by Microsoft Research
  ☆100Updated 9 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)
  ☆80Updated 3 years ago
• efficient / cicada-engine
  The Cicada engine
  ☆58Updated 8 years ago
• caetanosauer / fineline-zero
  ☆12Updated 6 years ago
• yxymit / Sundial
  Sundial: A distributed OLTP database testbed.
  ☆38Updated 4 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)
  ☆63Updated 3 months ago
• sfu-dis / tabular
  Tabular: Efficiently Building Efficient Indexes (VLDB 2025)
  ☆21Updated 3 months ago
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆29Updated 4 years ago
• viktorleis / perfevent
  An easy-to-use, header-only C++ wrapper for Linux' perf event API
  ☆128Updated 4 months ago
• L-v-M / async
  ☆20Updated 2 years ago
• rafaelkallis / adaptive-radix-tree
  An adaptive radix tree for efficient indexing in main memory.
  ☆162Updated last year
• fzhedu / db-imv
  Reducing the cache misses of SIMD vectorization using IMV
  ☆28Updated 3 years ago
• peterboncz / bloomfilter-repro
  ☆30Updated 5 years ago