Deathhush / HushDBLinks
HushDB is an experimental relational database. It aims to have an extensible design so that different parts, like optimizer and storage engine can be easily substitued with different implementations to explore new ideas in the database area.
☆87Updated 9 years ago
Alternatives and similar repositories for HushDB
Users that are interested in HushDB are comparing it to the libraries listed below
Sorting:
- Yet another write-optimized storage engine, using buffered B-tree algorithm inspired by TokuDB☆426Updated 12 years ago
- TerichDB, an open source data store based on terark engine☆374Updated 7 years ago
- Claims is an in-memory parallel database prototype, which runs on clusters of shared-nothing servers and provides efficient and scalable …☆116Updated 7 years ago
- Distributed In-Memory Index 分布式内存索引☆329Updated 6 years ago
- The tiny bitcask storage engine☆113Updated 6 years ago
- Paxos Made Easy: The Geometric Meaning and Geometric Proof of Paxos Algorithm☆142Updated 4 years ago
- Yet Another RAFT implementation☆126Updated 6 years ago
- A simple coroutine☆39Updated 10 years ago
- annotate the source code of jemalloc 4.2.1☆111Updated 5 months ago
- A raft consensus implementation that is simply and understandable☆321Updated 6 years ago
- a distributed storage engine☆89Updated 8 years ago
- levi-db is a fast database engine☆36Updated 7 years ago
- Spring 2014. Stanford CS346 project. A mini relational database with query optimization☆166Updated 10 years ago
- A mini database implementation.☆236Updated last year
- innodb分析版本☆77Updated 10 years ago
- TDH_Socket_Plugin_for_MySQL is a MySQL plugin which like HandlerSocket.☆166Updated 12 years ago
- Substitute for bloom filter.☆330Updated 4 years ago
- The larva programming Language☆145Updated 2 years ago
- ☆316Updated 6 years ago
- Call a function in a new stack that allocated anywhere. Do not be afraid of stack limit in your coroutines! Try to make your stack sharea…☆233Updated 4 years ago
- 读论文的总结☆306Updated 8 years ago
- C library for estimating cardinality in streams for which it is infeasible to store all events in memory☆248Updated 8 years ago
- ☆171Updated 9 years ago
- ☆130Updated 2 years ago
- ☆18Updated 8 years ago
- iNexus, coordinate large scale services☆215Updated 4 years ago
- Coroutine + AsyncIO + B-Tree = AsyncDB☆67Updated 6 years ago
- 多处理器编程的艺术☆116Updated 10 years ago
- ☆51Updated 5 years ago
- A stable and reliable SQL & NoSQL support RAM database☆68Updated 9 years ago