julienschmidt / moderndbsLinks
Basic Database System implemented for MDBS course
☆13Updated 11 years ago
Alternatives and similar repositories for moderndbs
Users that are interested in moderndbs are comparing it to the libraries listed below
Sorting:
- A SQL-to-native-code compiler based on LLVM☆48Updated 9 years ago
- Key-Value/Document store database library with btree and ARTree indexing methods, SSN-MVCC concurrency☆75Updated 4 years ago
- Key-Value Store for Non-Volatile Memories uDepot☆45Updated 3 years ago
- ☆20Updated 2 years ago
- Concurrent Log-Structured Memory for Many-Core Key-Value Stores☆35Updated 5 years ago
- "Byteslice: Pushing the envelop of main memory data processing with a new storage layout" (SIGMOD'15)☆25Updated 7 years ago
- Implementation of the BwTree as specified by Microsoft Research☆100Updated 9 years ago
- The Cicada engine☆59Updated 8 years ago
- C++11 port of the PostgreSQL DBMS☆69Updated 9 years ago
- A simple Disk-based Key-Value Store☆15Updated 6 years ago
- ☆12Updated 6 years ago
- A low-latency, extensible, multi-tenant key-value store.☆55Updated 4 years ago
- Couchbase Key-Value Engine☆141Updated this week
- The array hash table, array burst trie and array BST, written in C, as described in my PhD thesis.☆42Updated 8 years ago
- RemixDB: A read- and write-optimized concurrent KV store. Fast point and range queries. Extremely low write-amplification.☆103Updated 2 years ago
- Dependably fast multi-core in-memory transactions☆20Updated 8 years ago
- A persistent LSM key-value store. FloDB is designed to scale with the number of threads and memory size.☆26Updated 8 years ago
- ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)☆91Updated 2 years ago
- W-TinyLFU cache C++11 header only implementation☆63Updated 6 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 9 years ago
- Compilation of concurrent data structures with at least lock-free or wait-free properties.☆76Updated 6 years ago
- Experiments in partially ordered SMR.☆48Updated 4 years ago
- ☆12Updated 4 years ago
- An implementation of Intel's concurrent B+Tree (Palm Tree)☆175Updated 9 years ago
- lock free modified prefix B+tree append-only database☆117Updated 10 years ago
- Code snippets for the workshop on concurrent data structure implementation.☆31Updated 12 years ago
- A in-memory storage manager, that can do versioning and fast scans☆50Updated 9 years ago
- Cuckoo Index: A Lightweight Secondary Index Structure☆129Updated 3 years ago
- Geo-replicated CalvinDB(Include the original CalvinDB and low latency version)☆25Updated 5 years ago
- ViyaDB in-memory columnar analytical data store☆115Updated 5 years ago