Alternatives and similar repositories for tx-trie

Users that are interested in tx-trie are comparing it to the libraries listed below

• flode / BwTree
  Implementation of the BwTree as specified by Microsoft Research
  ☆101Updated 9 years ago
• sears / bLSM
  Read- and latency-optimized log structured merge tree
  ☆175Updated 13 years ago
• efficient / fast-succinct-trie
  ☆27Updated 8 years ago
• naskitis / Cache-Conscious-Data-Structures
  The array hash table, array burst trie and array BST, written in C, as described in my PhD thesis.
  ☆45Updated 9 years ago
• wuxb45 / lsm-trie
  LSM-trie
  ☆114Updated 4 years ago
• vimpunk / w-tinylfu
  W-TinyLFU cache C++11 header only implementation
  ☆63Updated 7 years ago
• rmind / masstree
  Masstree -- lockless cache-aware trie of B+ trees [experimental]
  ☆100Updated 7 years ago
• stanford-futuredata / index-baselines
  Simple baselines for "Learned Indexes"
  ☆160Updated 8 years ago
• Tokutek / ft-index
  This is a mirror of github.com/percona/PerconaFT that is kept here for legacy purposes.
  ☆96Updated 6 years ago
• LMDB / dbbench
  Embedded DB Benchmark Framework
  ☆62Updated 5 years ago
• lemire / FastDifferentialCoding
  Fast differential coding functions (using SIMD instructions)
  ☆55Updated 8 years ago
• rmind / libqsbr
  QSBR and EBR library
  ☆135Updated 6 years ago
• daq-db / daqdb
  DB for DAQ systems based on Persistent Memory and NVMe drives
  ☆21Updated 5 years ago
• thawk105 / ccbench
  Concurrency Control Benchmark
  ☆48Updated 2 years ago
• oscarlab / Be-Tree
  A simple, reference implementation of a B^e-tree
  ☆163Updated 6 years ago
• hyrise / hyrise-v1
  HYRISE In-Memory Hybrid Storage Engine (archived, now developed in hyrise/hyrise repo)
  ☆89Updated 8 years ago
• ot / partitioned_elias_fano
  Code used for the experiments in the paper "Partitioned Elias-Fano Indexes"
  ☆40Updated 11 years ago
• hydro-project / anna-cache
  A local cache for the Anna KVS
  ☆24Updated 5 years ago
• google / cuckoo-index
  Cuckoo Index: A Lightweight Secondary Index Structure
  ☆129Updated 4 years ago
• malbrain / Btree-source-code
  A working project for High-concurrency B-tree source code in C
  ☆252Updated 5 years ago
• ot / ds2i
  A library of inverted index data structures
  ☆151Updated 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
• OrangeTide / btree
  lock free modified prefix B+tree append-only database
  ☆116Updated 10 years ago
• argv0 / nbds
  C implementations of several scalable non-blocking data structures for x86 and x86-64.
  ☆38Updated 14 years ago
• efficient / cicada-engine
  The Cicada engine
  ☆59Updated 8 years ago
• runshenzhu / palmtree
  An implementation of Intel's concurrent B+Tree (Palm Tree)
  ☆176Updated 9 years ago
• ucf-cs / Tervel
  Fast wait-free algorithms designed for shared memory systems
  ☆45Updated 7 years ago
• caetanosauer / fineline-zero
  ☆12Updated 7 years ago
• IBM / uDepot
  Key-Value Store for Non-Volatile Memories uDepot
  ☆46Updated 3 years ago
• fast-pack / FrameOfReference
  C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference
  ☆54Updated last year