From 19k to 4.2M events/sec: story of a SQLite query optimisation(mnt.io)
mnt.io
From 19k to 4.2M events/sec: story of a SQLite query optimisation
https://mnt.io/articles/from-19k-to-4-2m-events-per-sec-story-of-a-sqlite-query-optimisation/
3 comments
Thanks for mentioning this other possibility! To be honest, I've discovered this possibility from you. Sadly, it doesn't improve the performance that much. We get the following performance:
- time: 98ms - throughput: 101Kelem/s
which is way slower than the 2.3ms and 4.18Melem/s we have with our final solution. It's even slower than the `CASE` without the `LEFT JOIN` (which was 39ms and 251Kelem/s).
Again, thanks for having pointed that out!
- time: 98ms - throughput: 101Kelem/s
which is way slower than the 2.3ms and 4.18Melem/s we have with our final solution. It's even slower than the `CASE` without the `LEFT JOIN` (which was 39ms and 251Kelem/s).
Again, thanks for having pointed that out!
These are exactly the problems that often make software maintenance actually interesting :)
with
I don't know if it more performant with Sqlite's query planner (and it may depend on many conditions, e.g. strict tables), but it looked like the obvious fix to the initial query. And it's 100% SQL, no need for a Rust hashmap.