Alternatives and similar repositories for tabular

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

• cosmoss-jigu / hydralist
  ☆30Updated 3 years ago
• sfu-dis / mosaicdb
  The Art of Latency Hiding in Modern Database Engines (VLDB 2024)
  ☆61Updated 6 months ago
• flode / ARTSynchronized
  ☆123Updated 3 years ago
• sfu-dis / ssd-vs-pm
  Cost/performance analysis of index structures on SSD and persistent memory (CIDR 2022)
  ☆36Updated 3 years ago
• yxymit / Sundial
  Sundial: A distributed OLTP database testbed.
  ☆38Updated 5 years ago
• baotonglu / dex
  DEX: Scalable Range Indexing on Disaggregated Memory
  ☆24Updated last year
• cuckoo-trie / cuckoo-trie-code
  ☆54Updated last year
• viktorleis / vmcache
  ☆74Updated last month
• fzhedu / db-imv
  Reducing the cache misses of SIMD vectorization using IMV
  ☆29Updated 3 years ago
• sfu-dis / pibench
  Benchmarking framework for index structures on persistent memory
  ☆89Updated 2 years ago
• jarulraj / n-store
  NVM Evaluation Testbed
  ☆29Updated 7 years ago
• readablesystems / sto
  Software Transactional Objects
  ☆56Updated last year
• hpides / autovec-db
  Code for our paper "Evaluating SIMD Compiler-Intrinsics for Database Systems"
  ☆15Updated 2 years ago
• sfu-dis / ermia
  ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)
  ☆92Updated 2 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)
  ☆68Updated last month
• huanchenz / index-microbench
  ☆15Updated 8 years ago
• wangziqi2016 / index-microbench
  ☆149Updated 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…
  ☆45Updated 4 months ago
• speedskater / hot
  HOT - Height Optimized Trie
  ☆156Updated 7 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
• hpides / viper
  Viper: A hybrid PMem-DRAM Key-Value Store for Persistent Memory (VLDB '21)
  ☆77Updated 3 years ago
• sfu-dis / optiql
  Optimistic queue-based reader-writer lock for robust index synchronization (SIGMOD 2024)
  ☆24Updated last year
• utsaslab / dinomo
  DINOMO: An Elastic, Scalable, High-Performance Key-Value Store for Disaggregated Persistent Memory (PVLDB 2022, VLDB 2023)
  ☆37Updated 2 years ago
• learnedsystems / LearnedSecondaryIndex
  A read-optimized learned index for unsorted data
  ☆32Updated 2 years ago
• baotonglu / apex
  High Performance Learned Index on Persistent Memory
  ☆48Updated 2 years ago
• jungmair / START
  Self-Tuning Adaptive Radix Tree
  ☆30Updated 5 years ago
• yingjunwu / IndexZoo
  Benchmarking In-Memory Index Structures
  ☆26Updated 6 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
• utsaslab / RECIPE
  RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)
  ☆194Updated last year
• chenhao-ye / polaris
  Source code for the SIGMOD '23 paper “Polaris: Enabling Transaction Priority in Optimistic Concurrency Control”
  ☆27Updated 2 years ago