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 10 years ago
- ☆20Updated 2 years ago
- Key-Value/Document store database library with btree and ARTree indexing methods, SSN-MVCC concurrency☆75Updated 4 years ago
- C++11 port of the PostgreSQL DBMS☆70Updated 9 years ago
- The array hash table, array burst trie and array BST, written in C, as described in my PhD thesis.☆43Updated 9 years ago
- ☆12Updated 7 years ago
- Key-Value Store for Non-Volatile Memories uDepot☆46Updated 3 years ago
- ☆12Updated 4 years ago
- The Cicada engine☆59Updated 8 years ago
- Cuckoo Index: A Lightweight Secondary Index Structure☆129Updated 4 years ago
- Implementation of the BwTree as specified by Microsoft Research☆101Updated 9 years ago
- ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)☆92Updated 3 years ago
- Code snippets for the workshop on concurrent data structure implementation.☆32Updated 12 years ago
- Couchbase Key-Value Engine☆145Updated 2 weeks ago
- "Byteslice: Pushing the envelop of main memory data processing with a new storage layout" (SIGMOD'15)☆25Updated 7 years ago
- Geo-replicated CalvinDB(Include the original CalvinDB and low latency version)☆24Updated 6 years ago
- lock free modified prefix B+tree append-only database☆116Updated 10 years ago
- Order-preserving key encoder☆127Updated 5 years ago
- Read- and latency-optimized log structured merge tree☆175Updated 13 years ago
- RemixDB: A read- and write-optimized concurrent KV store. Fast point and range queries. Extremely low write-amplification.☆102Updated 2 years ago
- A fork of Couchbase ForestDB project, aiming at making it simple and generic☆18Updated 8 months ago
- Concurrent Log-Structured Memory for Many-Core Key-Value Stores☆36Updated 5 years ago
- A four-dimensional Analysis of Partitioned Approximate Filters☆11Updated 4 months ago
- HOT - Height Optimized Trie☆158Updated 7 years ago
- Optimizing database queries with array programming☆20Updated 5 years ago
- Append-only key-value database on a distributed shared-log☆52Updated last year
- Artifact for PPoPP'18☆19Updated 3 years ago
- W-TinyLFU cache C++11 header only implementation☆63Updated 7 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
- Compilation of concurrent data structures with at least lock-free or wait-free properties.☆76Updated 6 years ago