Alternatives and similar repositories for kd_GeRaF

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

• stanford-futuredata / index-baselines
  Simple baselines for "Learned Indexes"
  ☆160Updated 8 years ago
• harald-lang / tree-encoded-bitmaps
  ☆39Updated 5 years ago
• google / cuckoo-index
  Cuckoo Index: A Lightweight Secondary Index Structure
  ☆129Updated 4 years ago
• learnedsystems / RadixSpline
  A Single-Pass Learned Index
  ☆137Updated 2 years ago
• efficient / HOPE
  Order-preserving key encoder
  ☆127Updated 5 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)
  ☆84Updated 3 years ago
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆33Updated 4 years ago
• lsds / LightSaber
  Multi-core Window-Based Stream Processing Engine
  ☆73Updated 4 years ago
• UWQuickstep / quickstep
  Quickstep project
  ☆44Updated last year
• DataManagementLab / ScaleStore
  This is the source code for our (Tobias Ziegler, Carsten Binnig and Viktor Leis) published paper at SIGMOD’22: ScaleStore: A Fast and Cos…
  ☆127Updated last year
• UWHustle / hustle
  In-memory, columnar, arrow-based database.
  ☆48Updated 3 years ago
• Sable / HorsePower
  Optimizing database queries with array programming
  ☆20Updated 5 years ago
• HewlettPackard / foedus_code
  FOEDUS main source code repository
  ☆64Updated 8 years ago
• fredrikwidlund / hash-function-benchmark
  Benchmark of common hash functions
  ☆38Updated 6 years ago
• lovasoa / TPCH-sqlite
  SQLite TPCH database
  ☆39Updated 8 years ago
• puffinn / puffinn
  Parameterless and Universal FInding of Nearest Neighbors
  ☆59Updated 10 months ago
• daravinds / Learned-Index-Structures
  An Implementation of Learned Indices and a Comparative Study against Traditional Index Structures
  ☆14Updated 7 years ago
• lsidir / imprints
  simd enabled column imprints
  ☆11Updated 7 years ago
• HazyResearch / EmptyHeaded
  Your worst case is our best case.
  ☆144Updated 8 years ago
• sfu-dis / bztree
  An open-source BzTree implementation
  ☆92Updated 4 years ago
• yxymit / Sundial
  Sundial: A distributed OLTP database testbed.
  ☆39Updated 5 years ago
• mkaguilera / yesquel
  Yesquel: scalable SQL storage for Web apps
  ☆43Updated 8 years ago
• sfu-dis / ermia
  ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)
  ☆92Updated 3 years ago
• paulross / skiplist
  A C++ skip list with Python bindings. This can be used to calculate a rolling median - fast!
  ☆50Updated last week
• ispras / postgres
  This is a modified version of PostgreSQL with just-in-time compiler for expressions. Current base version is 9.6.1.
  ☆54Updated 9 years ago
• Legacy25 / ValkyrieDB
  A SQL-to-native-code compiler based on LLVM
  ☆48Updated 10 years ago
• hydro-project / anna-cache
  A local cache for the Anna KVS
  ☆24Updated 5 years ago
• graindb / graindb
  ☆20Updated 4 years ago
• anikristo / LearnedSort
  Learned Sort: a model-enhanced sorting algorithm
  ☆81Updated 4 years ago
• dhanus / lsm-tree
  This is an implementation of a log structure merge tree.
  ☆59Updated 8 years ago