Alternatives and similar repositories for tabular

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

• flode / ARTSynchronized
  ☆121Updated 3 years ago
• cosmoss-jigu / hydralist
  ☆30Updated 2 years ago
• wangziqi2016 / index-microbench
  ☆149Updated 2 years ago
• sfu-dis / pibench
  Benchmarking framework for index structures on persistent memory
  ☆88Updated 2 years ago
• viktorleis / vmcache
  ☆72Updated 5 months ago
• sfu-dis / mosaicdb
  The Art of Latency Hiding in Modern Database Engines (VLDB 2024)
  ☆59Updated 4 months ago
• sfu-dis / ssd-vs-pm
  Cost/performance analysis of index structures on SSD and persistent memory (CIDR 2022)
  ☆36Updated 3 years ago
• cuckoo-trie / cuckoo-trie-code
  ☆54Updated last year
• yxymit / Sundial
  Sundial: A distributed OLTP database testbed.
  ☆38Updated 4 years ago
• hpides / autovec-db
  Code for our paper "Evaluating SIMD Compiler-Intrinsics for Database Systems"
  ☆14Updated 2 years ago
• sfu-dis / ermia
  ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)
  ☆91Updated 2 years ago
• speedskater / hot
  HOT - Height Optimized Trie
  ☆156Updated 7 years ago
• baotonglu / dex
  DEX: Scalable Range Indexing on Disaggregated Memory
  ☆23Updated last year
• jarulraj / n-store
  NVM Evaluation Testbed
  ☆29Updated 7 years ago
• readablesystems / sto
  Software Transactional Objects
  ☆58Updated last year
• mitdbg / deneva
  Deneva is a distributed in-memory database framework that supports the evaluation of various concurrency control algorithms.
  ☆117Updated 2 years ago
• jungmair / START
  Self-Tuning Adaptive Radix Tree
  ☆28Updated 5 years ago
• evanj / tpccbench
  In memory TPC-C implementation. Used for a number of database research projects.
  ☆38Updated 4 years ago
• learnedsystems / LearnedSecondaryIndex
  A read-optimized learned index for unsorted data
  ☆31Updated 2 years ago
• utsaslab / RECIPE
  RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)
  ☆196Updated 10 months 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 / optiql
  Optimistic queue-based reader-writer lock for robust index synchronization (SIGMOD 2024)
  ☆24Updated last year
• fzhedu / db-imv
  Reducing the cache misses of SIMD vectorization using IMV
  ☆28Updated 3 years ago
• hpides / viper
  Viper: A hybrid PMem-DRAM Key-Value Store for Persistent Memory (VLDB '21)
  ☆76Updated 3 years ago
• CloudOLTP / Cornus
  ☆22Updated 2 years ago
• zxjcarrot / 2-Tree
  Tiered Indexing is a general approach to improve the memory utilization of buffer-managed data structures including B+tree, Hashing, Heap…
  ☆36Updated 2 months ago
• huanchenz / index-microbench
  ☆15Updated 8 years ago
• theoanab / SILK-USENIXATC2019
  Code for "SILK: Preventing Latency Spikes in Log-Structured Merge Key-Value Stores" published in USENIX ATC 19
  ☆92Updated 2 years ago
• Erins-Ransom / Proteus
  This is the code for our self-designing range filter as described in our SIGMOD'22 paper of the same name.
  ☆13Updated 2 years ago
• DICL / FAST_FAIR
  Endurable Transient Inconsistency in Byte-Addressable Persistent B+-Tree
  ☆118Updated 4 years ago