> What we learned along the way… Deleting rows doesn’t shrink SQLite files<p>This is true of every RDBMS I am aware of. It would be horribly inefficient to constantly run page merges in order to be able to free some of them.<p>Whenever I read things on posts that are a. discussed in documentation b. should be apparent from first principles, I immediately lose faith in the product.
I spent years trying to squeeze this use case out of sqlite. All roads lead to tears, it is <i>not</i> made for this use case.<p>I wrote <a href="https://github.com/anacrolix/possum" rel="nofollow">https://github.com/anacrolix/possum</a> for this exact use case. It has a few rough edges but it absolutely hauls ass for caching on disk. Incidentally it uses sqlite for transaction/TTL metadata which is more suited to sqlite but it's <i>still</i> the bottleneck.<p>sqlite transaction commit overhead is too high and uncompetitive without batching but it's a design flaw specific to being multiprocess.
> Incidentally it uses sqlite for transaction/TTL metadata which is more suited to sqlite but it's still the bottleneck.<p>Why sqlite instead of RocksDB ?<p>What you need at the end of the day for a blob storage is a transactional key value store.<p>Which RocksDB will give you with much better throughput (and latency) and solves your transaction problem.
At the end of the day durable transaction commit in any OLTP database will always be slow because fsync is an expensive operation (~1000 IOPS on a decent SSD), so as you mentioned batching is the only way to make significant increases to throughput. That said, based on assorted benchmarks I've seen online, sqlite doesn't even get close to max fsync IOPS because it has a ton of overhead. Other embedded systems like rocksdb or lmdb are going to give better performance.
I wonder if they tried storing diffs instead, and compacting them once in a while.<p>These are user preferences for UI setup, and they have a lot of write traffic. But probably each user changes their preferences only by a little bit each time. Their 1MB writes would go down to just the small diffs.<p>They could store the diffs and transparently apply them before sending to the client. After some timeout or maybe after a certain number of diffs have accumulated, squash them all and write back.<p>They’d still need a server and custom code to handle this but it would probably reduce the database load and SSD writes by a lot. And let them just use something off-the-shelf for storage.
OpenStack Swift uses SQLite for storing metadata. Each account has one SQLite db. Each container also initially had one SQLite db but in 2018 they added support for sharding so if a container has more than 1 million objects, the container is split into multiple SQLite databases. The performance is not ideal. Ceph scales much better.
This looks like a classic case of nih/reinventing wheel.
> JSON blobs<p>An alternative to faster blob storage is to represent the blob's schema in SQL directly.<p>If most blob updates are incremental you can eliminate a significant amount of storage IO and garbage collection this way.<p>One SQLite database per blob type with a metadata SQLite db that tracks each. We could leverage powerful AI reasoning models to produce SQLite schemas and virtual table adapters for each encountered JSON schema type.
What is the consistency model? What happens if a node is down unexpectedly?
I couldn't find the word "replication" in the post or on the GitHub page. So, what about fault tolerance?
If only rethinkdb hadn’t nose dived. It supported sharding, health checks, clustering with failover. Write performance was quite good as I recall.
Sounds like you should use a database-per-user design.
As the post mentions "trading" and "50% writes", I guess that most writes are derived from live market data, and probably not user-specific but shared.
Right, then even sqlite should be enough?
Reads like this is be a perfect fit for ClickHouse. You should do async inserts, remove the 20 or so _log options ClickHouse enables for some insane defaults and batch them in Redis if needed (probablynot). Then you have automatic compression, free ttl, no write concurrency.
A limitation that i ran into with sqlite was not being able to interact with it over the network e.g. NFS. Does this solve that problem?
Why not rqlite?
> Horizontally scalable, distributed.<p>This doesn't describe rqlite, at least.
(Hi Phil!)<p>Correct, I read the post. Agreed, rqlite is not a great fit for high-throughput durable writes since all writes go through the Raft Leader. This is not specific to rqlite -- all systems which put Raft in the data plane[1] have the same challenge.<p>rqlite does offer a Queued Writes mode[2], which allows you to trade some durability for much greater write throughput. The post mentions something similar -- async_write -- but their post claims they also make the data queryable before it is durable,unlike rqlite.<p>[1] <a href="https://youtu.be/8XbxQ1Epi5w?t=2306" rel="nofollow">https://youtu.be/8XbxQ1Epi5w?t=2306</a><p>[2] <a href="https://rqlite.io/docs/api/queued-writes/" rel="nofollow">https://rqlite.io/docs/api/queued-writes/</a>
rqlite[1] author here, happy to answer any questions.<p>[1] <a href="https://rqlite.io" rel="nofollow">https://rqlite.io</a>
To confirm this is being stored on devices rather than on a server side environment?
So many comments about things already addressed in the article <i>sigh</i>
What about using, ahem, files?
all roads lead to sqlite
Sounds like it solves their particular problem, but hardly can be used by outsiders in the current state.<p>Bad fault tolerance, no words on replication or backup. Offline rebalance... meh. I am not sure how I feel about their choice of Redis protocol.
Is the db still a single, portable file?
so it's just sharding?
[flagged]
[flagged]
[flagged]
[flagged]
[flagged]
[flagged]
[flagged]
[flagged]
[flagged]