hillbig / tx-trie
Automatically exported from code.google.com/p/tx-trie
☆29Updated 9 years ago
Alternatives and similar repositories for tx-trie:
Users that are interested in tx-trie are comparing it to the libraries listed below
- Code used for the experiments in the paper "Partitioned Elias-Fano Indexes"☆40Updated 10 years ago
- ☆25Updated 7 years ago
- ☆12Updated 6 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
- Read- and latency-optimized log structured merge tree☆174Updated 12 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆54Updated last year
- HYRISE In-Memory Hybrid Storage Engine (archived, now developed in hyrise/hyrise repo)☆89Updated 7 years ago
- Fast differential coding functions (using SIMD instructions)☆52Updated 7 years ago
- LSM-trie☆113Updated 3 years ago
- Implementation of the BwTree as specified by Microsoft Research☆100Updated 8 years ago
- DB for DAQ systems based on Persistent Memory and NVMe drives☆21Updated 4 years ago
- Feed-forward Bloom filters☆52Updated 13 years ago
- Artifact for PPoPP'18☆18Updated 2 years ago
- C implementations of several scalable non-blocking data structures for x86 and x86-64.☆38Updated 13 years ago
- Masstree -- lockless cache-aware trie of B+ trees [experimental]☆99Updated 6 years ago
- A data structure and algorithm library built for TerarkDB☆62Updated 2 years ago
- Code snippets for the workshop on concurrent data structure implementation.☆31Updated 12 years ago
- Embedded DB Benchmark Framework☆60Updated 4 years ago
- Count-Min sketch-based approximate counting library☆45Updated 6 years ago
- The Cicada engine☆55Updated 7 years ago
- FOEDUS main source code repository☆64Updated 7 years ago
- W-TinyLFU cache C++11 header only implementation☆57Updated 6 years ago
- Fork of the Shore-MT storage manager used by the research project Instant Recovery☆29Updated 6 years ago
- An implementation of Intel's concurrent B+Tree (Palm Tree)☆174Updated 8 years ago
- The world's first wait-free KV store with generic durable linearizable transactions☆40Updated 3 years ago
- Simple baselines for "Learned Indexes"☆159Updated 7 years ago
- A Distributed Key-Value Store for FAWN☆76Updated 14 years ago
- ☆11Updated 6 years ago
- Dependably fast multi-core in-memory transactions☆19Updated 7 years ago
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆48Updated 2 years ago