Alternatives and similar repositories for tx-trie:

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

• ot / partitioned_elias_fano
  Code used for the experiments in the paper "Partitioned Elias-Fano Indexes"
  ☆40Updated 10 years ago
• efficient / fast-succinct-trie
  ☆25Updated 7 years ago
• caetanosauer / fineline-zero
  ☆12Updated 6 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.
  ☆42Updated 8 years ago
• sears / bLSM
  Read- and latency-optimized log structured merge tree
  ☆174Updated 12 years ago
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆54Updated last year
• hyrise / hyrise-v1
  HYRISE In-Memory Hybrid Storage Engine (archived, now developed in hyrise/hyrise repo)
  ☆89Updated 7 years ago
• lemire / FastDifferentialCoding
  Fast differential coding functions (using SIMD instructions)
  ☆52Updated 7 years ago
• wuxb45 / lsm-trie
  LSM-trie
  ☆113Updated 3 years ago
• flode / BwTree
  Implementation of the BwTree as specified by Microsoft Research
  ☆100Updated 8 years ago
• daq-db / daqdb
  DB for DAQ systems based on Persistent Memory and NVMe drives
  ☆21Updated 4 years ago
• efficient / ffbf
  Feed-forward Bloom filters
  ☆52Updated 13 years ago
• urcs-sync / Interval-Based-Reclamation
  Artifact for PPoPP'18
  ☆18Updated 2 years ago
• argv0 / nbds
  C implementations of several scalable non-blocking data structures for x86 and x86-64.
  ☆38Updated 13 years ago
• rmind / masstree
  Masstree -- lockless cache-aware trie of B+ trees [experimental]
  ☆99Updated 6 years ago
• bytedance / terark-zip
  A data structure and algorithm library built for TerarkDB
  ☆62Updated 2 years ago
• stephentu / scalex
  Code snippets for the workshop on concurrent data structure implementation.
  ☆31Updated 12 years ago
• LMDB / dbbench
  Embedded DB Benchmark Framework
  ☆60Updated 4 years ago
• s-yata / madoka
  Count-Min sketch-based approximate counting library
  ☆45Updated 6 years ago
• efficient / cicada-engine
  The Cicada engine
  ☆55Updated 7 years ago
• HewlettPackard / foedus_code
  FOEDUS main source code repository
  ☆64Updated 7 years ago
• vimpunk / w-tinylfu
  W-TinyLFU cache C++11 header only implementation
  ☆57Updated 6 years ago
• caetanosauer / zero
  Fork of the Shore-MT storage manager used by the research project Instant Recovery
  ☆29Updated 6 years ago
• runshenzhu / palmtree
  An implementation of Intel's concurrent B+Tree (Palm Tree)
  ☆174Updated 8 years ago
• pramalhe / RedoDB
  The world's first wait-free KV store with generic durable linearizable transactions
  ☆40Updated 3 years ago
• stanford-futuredata / index-baselines
  Simple baselines for "Learned Indexes"
  ☆159Updated 7 years ago
• vrv / FAWN-KV
  A Distributed Key-Value Store for FAWN
  ☆76Updated 14 years ago
• efficient / ARF
  ☆11Updated 6 years ago
• efficient / cicada
  Dependably fast multi-core in-memory transactions
  ☆19Updated 7 years ago
• TomerEven / Prefix-Filter
  Prefix Filter: Practically and Theoretically Better Than Bloom.
  ☆48Updated 2 years ago