This is a chronicle of my experiment where I set out to insert 1B rows in SQLite
SQLite: How it works, by Richard Hipp
Making SQLite faster in Go
Make sqlite faster with a connection pool and prepared statements.
Honker
Durable queues, streams, pub/sub, and time-trigger scheduling on SQLite. One file, zero servers.
An entire Social Network in 1.6GB (GraphD Part 2)
Roaring Bitmaps offer an even more efficient way to store and query an entire social graph, fitting the entire network of 5.5M users and 164M+ follows into a ~1.6GB SQLite DB on disk.
What would SQLite look like if written in Rust? — Part 1
Writing a SQLite clone from scratch in Rust
Litestream
Litestream is an open-source, real-time streaming replication tool that lets you safely run SQLite applications on a single node.
Deep dive into Turso, the "SQLite rewrite in Rust"
I love Rust and I love SQLite, so you can guess. Iwas pretty excited when I lerned that "SQLite was rewritten in Rust" What is SQLite, actually? 2 things: a
Introducing Bulk Upload: Turn a Spreadsheet Into Scheduled Posts in Seconds
Schedule up to 100 posts at once with Buffer’s new Bulk Upload feature. Import a CSV, review your posts, and publish. Ideal for creators, teams, and agencies who plan social content in spreadsheets.
Your Data Fits in Memory (GraphD Part 1)
We need a fast way to query multiple potentially large sets of data on-demand at interactive speeds. Sometimes the easiest solution to a hard problem is to build the right tool for the job.
The SQLite R*Tree Module
An R-Tree is a special index that is designed for doing range queries. R-Trees are most commonly used in geospatial systems where each entry is a rectangle with minimum and maximum X and Y coordinates. Given a query rectangle, an R-Tree is able to quickly find all entries that are contained within the query rectangle or which overlap the query rectangle. This idea is easily extended to three dimensions for use in CAD systems. R-Trees also find use in time-domain range look-ups. For example, suppose a database records the starting and ending times for a large number of events. A R-Tree is able to quickly find all events that were active at any time during a given time interval, or all events that started during a particular time interval, or all events that both started and ended within a given time interval. And so forth.
