-
You might be interested in https://github.com/google/btree and having a default tree based around a PK. A simpler tree like an AVL or Red-Black Tree would let you do efficient range lookups for the PK as well.
-
CodeRabbit
CodeRabbit: AI Code Reviews for Developers. Revolutionize your code reviews with AI. CodeRabbit offers PR summaries, code walkthroughs, 1-click suggestions, and AST-based analysis. Boost productivity and code quality across all major languages with each PR.
-
For another in-memory database example, you could also check out https://github.com/hashicorp/go-memdb, but it's based on a radix tree implementation.
-
go-mysql-server
A MySQL-compatible relational database with a storage agnostic query engine. Implemented in pure Go.
Might be interested in https://github.com/dolthub/go-mysql-server, which also does this
Related posts
-
A Golang library and interface that allows querying anything with SQL
-
We're building a fuzzer for our versioned SQL database. It's catching bugs so you don't.
-
A MySQL-compatible relational database with a storage agnostic query engine. Implemented in pure Go.
-
A MySQL-compatible relational database with a storage agnostic query engine. Implemented in pure Go.
-
A MySQL-compatible relational database with a storage agnostic query engine. Implemented in pure Go.