futurewei-cloud / QuantaDBLinks
☆14Updated 2 years ago
Alternatives and similar repositories for QuantaDB
Users that are interested in QuantaDB are comparing it to the libraries listed below
Sorting:
- Key-Value Store for Non-Volatile Memories uDepot☆45Updated 3 years ago
- Code of the paper "Building an Efficient Key-Value Store in a Flexible Address Space", EuroSys '22☆21Updated 5 months ago
- PAIO: General, Portable I/O Optimizations With Minor Application Modifications (FAST'22)☆24Updated 2 years ago
- ☆30Updated 2 years ago
- ☆28Updated 4 years ago
- Grizzly: Efficient Stream Processing Through Adaptive Query Compilation☆16Updated 5 years ago
- Nova-LSM is a component-based design of the LSM-tree using fast and high bandwidth networks such as RDMA.☆52Updated 3 years ago
- SLOG: Serializable, Low-latency, Geo-replicated Transactions☆46Updated 2 years ago
- Lightning In-Memory Object Store☆47Updated 3 years ago
- RemixDB: A read- and write-optimized concurrent KV store. Fast point and range queries. Extremely low write-amplification.☆103Updated 2 years ago
- A local cache for the Anna KVS☆25Updated 5 years ago
- In-memory, columnar, arrow-based database.☆49Updated 3 years ago
- A data structure and algorithm library built for TerarkDB☆67Updated 3 years ago
- ☆12Updated 6 years ago
- A low-latency, extensible, multi-tenant key-value store.☆55Updated 4 years ago
- ☆21Updated 4 years ago
- ☆20Updated 2 years ago
- A decentralized scalar timestamp scheme☆16Updated 4 years ago
- ☆121Updated 2 years ago
- EuroSys '24: "Trinity: A Fast Compressed Multi-attribute Data Store"☆19Updated 6 months ago
- InfiniStore: an elastic serverless cloud storage system (VLDB'23)☆24Updated 2 years ago
- This is the source code for our (Tobias Ziegler, Carsten Binnig and Viktor Leis) published paper at SIGMOD’22: ScaleStore: A Fast and Cos…☆123Updated 11 months ago
- Sundial: A distributed OLTP database testbed.☆38Updated 4 years ago
- A four-dimensional Analysis of Partitioned Approximate Filters☆11Updated last month
- Low-Latency Transaction Scheduling via Userspace Interrupts: Why Wait or Yield When You Can Preempt? (SIGMOD 2025 Best Paper Award)☆65Updated 4 months ago
- ☆19Updated 8 months ago
- An open-source BzTree implementation☆92Updated 4 years ago
- Self-Tuning Adaptive Radix Tree☆28Updated 5 years ago
- Source code for the FAST '23 paper “MadFS: Per-File Virtualization for Userspace Persistent Memory Filesystems”☆43Updated 2 years ago
- Adaptive Radix Tree in C++☆47Updated this week