sqlite VS sortedcontainers

SQL (Structured Query Language) databases are relational databases. They organize data into tables with rows and columns, and they use SQL for querying and managing data. Examples include MySQL, PostgreSQL, and SQLite.

SQLite: A lightweight, self-contained SQL database, best for standalone applications, embedded systems, or small-scale applications not requiring a client/server DBMS.

FerretDB is an open source document database that adds MongoDB compatibility to other database backends, such as Postgres and SQLite. By using FerretDB, developers can access familiar MongoDB features and tools using the same syntax and commands for many of their use cases.

Rust stdlib code is quite high quality although not particularly dense due to large amount of comments. Start from the docs, and click any source link: https://doc.rust-lang.org/std/vec/struct.Vec.html

Sqlite is supposedly high quality C code: https://github.com/smparkes/sqlite

For videos of someone (Casey Muratori) writing video game code and debugging it, Handmade Hero: https://handmadehero.org/

A blog post about how to write code by the same author: https://caseymuratori.com/blog_0015

For how to implement a fairly advanced type system, Typing Haskell in Haskell: https://gist.github.com/chrisdone/0075a16b32bfd4f62b7b

But, honestly, you're probably better off writing code yourself and learning by doing.

If you like Python, the library sortedcontainers as a clear, well documented, yet short source code that is a joy to read for a non trivial problem:

https://github.com/grantjenks/python-sortedcontainers/blob/m...

See for yourself. Looks like sortedset uses sortedlist under the hood, which itself uses a list of lists under the hood.

You could use http://www.grantjenks.com/docs/sortedcontainers/ instead!

Even the Gentoo package repository manages fine with a two-level hierarchy. There's also a Python library, sortedcontainers, that suggests two-level trees are pretty good at any reasonable human-scale (and beyond), even while fixed-arity trees are asymptotically optimal.

It's a good question and to be accurate, depending on the benchmark, Mongita is about the same speed at SQLite to several-times slower.

There is less happening algorithmically than you would think. Where the tricky slow bits do exist, they have largely fallen into the happy-path of fast data structures in the Python language/stdlib. I also use sortedcontainers for indexes which helped quite a bit (http://www.grantjenks.com/docs/sortedcontainers/).

If you're curious, the benchmark code is in the repo: https://github.com/scottrogowski/mongita/blob/master/benchma...

I’d like to add sortedcontainers. I use it all the time. It basically does what it says on the tin. Other than the SortedList, the fact that the container is sorted only comes into play when you iterate over it or perform a bisect left/right.