Alternatives and similar repositories for carrot

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

• rafaelkallis / adaptive-radix-tree
  An adaptive radix tree for efficient indexing in main memory.
  ☆166Updated last year
• cwida / rma
  Sequential implementation of the Rewired Memory Array.
  ☆19Updated 6 years ago
• speedskater / hot
  HOT - Height Optimized Trie
  ☆156Updated 7 years ago
• harald-lang / tree-encoded-bitmaps
  ☆38Updated 5 years ago
• eBay / Jungle
  An embedded key-value store library specialized for building state machine and log store
  ☆236Updated 2 months ago
• graphflow / graphflow-columnar-techniques
  ☆26Updated 3 years ago
• mitdbg / treeline
  An update-in-place key-value store for modern storage.
  ☆144Updated last year
• Cavalia / Cavalia
  A transactional main-memory database system on multicores
  ☆104Updated 7 years ago
• MorphStore / TVLLib
  Template Vector Library
  ☆18Updated 4 years ago
• runshenzhu / palmtree
  An implementation of Intel's concurrent B+Tree (Palm Tree)
  ☆176Updated 9 years ago
• queryproc / optimizing-subgraph-queries-combining-binary-and-worst-case-optimal-joins
  Code for the paper titled "Optimizing Subgraph Queries by Combining Binary and Worst-Case Optimal Joins". VLDB'19
  ☆33Updated 5 months ago
• schroederdewitt / leapfrog-triejoin
  High-performance (C++) implementation of the leapfrog-triejoin algorithm by Todd Veldhuizen (http://arxiv.org/abs/1210.0481)
  ☆22Updated 9 years ago
• eourcs / LockFreeCuckooHash
  A fully concurrent lock-free cuckoo hash table implementation
  ☆56Updated 8 years ago
• UWQuickstep / quickstep
  Quickstep project
  ☆42Updated 11 months ago
• bcaine / learned_indices
  A C++11 implementation of the B-Tree part of "The Case for Learned Index Structures"
  ☆81Updated 7 years ago
• eyalroz / c-store
  C-Store : A column-oriented DBMS prototype (frozen)
  ☆48Updated 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)
  ☆82Updated 3 years ago
• yingjunwu / IndexZoo
  Benchmarking In-Memory Index Structures
  ☆26Updated 6 years ago
• jungmair / START
  Self-Tuning Adaptive Radix Tree
  ☆30Updated 5 years ago
• UCHI-DB / sboost
  SBoost is a SIMD-based C++ library enabling fast filtering and decoding of lightweight encoded data
  ☆11Updated 4 years ago
• google / cuckoo-index
  Cuckoo Index: A Lightweight Secondary Index Structure
  ☆129Updated 3 years ago
• flode / ARTSynchronized
  ☆122Updated 3 years ago
• phamtai97 / key-value-store
  Implemet Key-Value store using BTree
  ☆65Updated 6 years ago
• malbrain / database
  Key-Value/Document store database library with btree and ARTree indexing methods, SSN-MVCC concurrency
  ☆75Updated 4 years ago
• efficient / cicada-engine
  The Cicada engine
  ☆59Updated 8 years ago
• bingmann / stx-btree
  OBSOLETE, contained in https://github.com/tlx/tlx - STX B+ Tree C++ Template Classes -
  ☆215Updated 2 years ago
• yangjufo / Learned-Indexes
  Implementation of BTree part for paper 'The Case for Learned Index Structures'
  ☆149Updated 6 years ago
• wagjamin / inkfuse
  InkFuse - An Experimental Database Runtime Unifying Vectorized and Compiled Query Execution.
  ☆53Updated last year
• LineairDB / LineairDB
  C++ fast transactional key-value storage.
  ☆171Updated last week
• TimoKersten / db-engine-paradigms
  Collection of experiments to carve out the differences between two types of relational query processing engines: Vectorizing (interpretat…
  ☆263Updated 7 years ago