hillbig / tx-trieLinks
Automatically exported from code.google.com/p/tx-trie
☆29Updated 10 years ago
Alternatives and similar repositories for tx-trie
Users that are interested in tx-trie are comparing it to the libraries listed below
Sorting:
- LSM-trie☆114Updated 4 years ago
- Read- and latency-optimized log structured merge tree☆174Updated 13 years ago
- Fast differential coding functions (using SIMD instructions)☆54Updated 7 years ago
- HYRISE In-Memory Hybrid Storage Engine (archived, now developed in hyrise/hyrise repo)☆89Updated 7 years ago
- The array hash table, array burst trie and array BST, written in C, as described in my PhD thesis.☆42Updated 8 years ago
- ☆27Updated 8 years ago
- Implementation of the BwTree as specified by Microsoft Research☆100Updated 9 years ago
- Code used for the experiments in the paper "Partitioned Elias-Fano Indexes"☆40Updated 10 years ago
- A comparison between different integer set techniques☆14Updated 7 years ago
- A simple, reference implementation of a B^e-tree☆157Updated 6 years ago
- Cuckoo Index: A Lightweight Secondary Index Structure☆129Updated 3 years ago
- A Distributed Key-Value Store for FAWN☆77Updated 14 years ago
- This is a mirror of github.com/percona/PerconaFT that is kept here for legacy purposes.☆95Updated 5 years ago
- QSBR and EBR library☆125Updated 5 years ago
- Simple baselines for "Learned Indexes"☆159Updated 7 years ago
- Masstree -- lockless cache-aware trie of B+ trees [experimental]☆100Updated 7 years ago
- W-TinyLFU cache C++11 header only implementation☆63Updated 6 years ago
- SILT: A Memory-Efficient, High-Performance Key-Value Store☆177Updated 3 years ago
- DB for DAQ systems based on Persistent Memory and NVMe drives☆21Updated 5 years ago
- Artifact for PPoPP'18☆19Updated 3 years ago
- A library of inverted index data structures☆150Updated 2 years ago
- ☆12Updated 6 years ago
- Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming☆49Updated 10 years ago
- lock free modified prefix B+tree append-only database☆117Updated 10 years ago
- Traditional data-structure designs, whether lock-based or lock-free, provide parallelism via fine grained synchronization among threads. …☆31Updated 14 years ago
- Key-Value Store for Non-Volatile Memories uDepot☆45Updated 3 years ago
- A working project for High-concurrency B-tree source code in C☆251Updated 5 years ago
- Embedded DB Benchmark Framework☆62Updated 4 years ago
- C++ implementation of HyperLogLog☆60Updated last year
- An implementation of Intel's concurrent B+Tree (Palm Tree)☆175Updated 9 years ago