thinkpad20 / sqlLinks
A front-end (lexer, parser and partial compiler) for a subset of the SQL language
☆45Updated 12 years ago
Alternatives and similar repositories for sql
Users that are interested in sql are comparing it to the libraries listed below
Sorting:
- Libhalog is an open-source high available redo-log library using multiple paxos.☆37Updated 7 years ago
- Key-Value/Document store database library with btree and ARTree indexing methods, SSN-MVCC concurrency☆75Updated 4 years ago
- A data structure and algorithm library built for TerarkDB☆67Updated 3 years ago
- Modern SQL parser using Bison (Yacc) and Flex☆90Updated 9 months ago
- A cache-efficiency weight balanced binary tree☆70Updated 11 years ago
- Implementation of the BwTree as specified by Microsoft Research☆99Updated 9 years ago
- B+ tree implementation in C☆132Updated 5 years ago
- Log-Structured Merge-Tree (LSM-Tree)☆89Updated 8 years ago
- A simple header-only Multiversion Concurrency Control (MVCC) implementation in C++11.☆26Updated 9 years ago
- Skiplist written in C/C++ language.☆27Updated 11 years ago
- A fork of Couchbase ForestDB project, aiming at making it simple and generic☆18Updated 6 months ago
- Solitaire is a Faster Linearizability Checker Supporting Multiple Data Model☆17Updated 7 years ago
- Adaptive Radix Tree in C++☆47Updated last week
- W-TinyLFU cache C++11 header only implementation☆63Updated 6 years ago
- A toy SQL engine built on top of LSM(LevelDB)☆22Updated 6 years ago
- The C++ TiKV client used by TiFlash.☆40Updated 3 weeks ago
- A working project for High-concurrency B-tree source code in C☆251Updated 5 years ago
- Yet another write-optimized storage engine, using buffered B-tree algorithm inspired by TokuDB☆426Updated 12 years ago
- 文档数据库mongodb kv存储引擎wiredtiger源码详细分析注释☆67Updated 3 months ago
- ☆14Updated 3 years ago
- Different implementations of spinlock.☆105Updated 10 years ago
- A high-performance, concurrent hash table☆24Updated 11 years ago
- High-Performance C++ Data System☆131Updated 2 months ago
- RemixDB: A read- and write-optimized concurrent KV store. Fast point and range queries. Extremely low write-amplification.☆102Updated 2 years ago
- Read- and latency-optimized log structured merge tree☆174Updated 13 years ago
- ☆13Updated 8 years ago
- Benchmark of common hash functions☆36Updated 6 years ago
- An implementation of Intel's concurrent B+Tree (Palm Tree)☆176Updated 9 years ago
- ☆66Updated 4 years ago
- Yet Another RAFT implementation☆125Updated 7 years ago