fzqneo / ByteSlice
"Byteslice: Pushing the envelop of main memory data processing with a new storage layout" (SIGMOD'15)
☆25Updated 6 years ago
Alternatives and similar repositories for ByteSlice:
Users that are interested in ByteSlice are comparing it to the libraries listed below
- ☆53Updated 9 months ago
- HOT - Height Optimized Trie☆144Updated 6 years ago
- ☆40Updated 11 months ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆29Updated 3 years ago
- An open-source BzTree implementation☆91Updated 3 years ago
- ☆20Updated 2 years ago
- Self-Tuning Adaptive Radix Tree☆27Updated 4 years ago
- Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)☆78Updated 2 years ago
- ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)☆88Updated 2 years ago
- The Cicada engine☆55Updated 7 years ago
- The Art of Latency Hiding in Modern Database Engines (VLDB 2024)☆55Updated 5 months ago
- Key-Value Store for Non-Volatile Memories uDepot☆45Updated 2 years ago
- Benchmarking In-Memory Index Structures☆26Updated 6 years ago
- Quickstep project☆42Updated 4 months ago
- ☆116Updated 2 years ago
- ☆14Updated 5 years ago
- Traditional data-structure designs, whether lock-based or lock-free, provide parallelism via fine grained synchronization among threads. …☆31Updated 14 years ago
- In memory TPC-C implementation. Used for a number of database research projects.☆38Updated 4 years ago
- NVM Evaluation Testbed☆29Updated 6 years ago
- A persistent LSM key-value store. FloDB is designed to scale with the number of threads and memory size.☆26Updated 7 years ago
- ☆37Updated 4 years ago
- Query engine synthesizer based on, our domain-specific language, VOILA☆13Updated 4 years ago
- Graphs analytics on collections of views!☆34Updated last year
- Source code of our implementation of the concurrent RMA☆13Updated 5 years ago
- SLOG: Serializable, Low-latency, Geo-replicated Transactions☆43Updated last year
- Low-Latency Transaction Scheduling via Userspace Interrupts: Why Wait or Yield When You Can Preempt? (SIGMOD 2025)☆42Updated last month
- ☆143Updated 2 years ago
- Implementation of the BwTree as specified by Microsoft Research☆100Updated 8 years ago
- Code and results for our paper "Analyzing Vectorized Hash Tables Across CPU Architectures" @ VLDB '23.☆24Updated last year
- pmwcas☆135Updated last year