summaryrefslogtreecommitdiffstats
path: root/content/posts/now-2025-summer.md
diff options
context:
space:
mode:
authorJan Tuomi <jan@jantuomi.fi>2026-01-02 21:34:54 +0200
committerJan Tuomi <jan@jantuomi.fi>2026-01-02 21:34:54 +0200
commit09664404e4fd59e3ec79b56907ac7c5178ec6656 (patch)
tree7bc959f7f795978b62a2b812e0ac9cf286dfaf06 /content/posts/now-2025-summer.md
parent7aff1f399ebfe289ed9ec8f38342f5d25eb60677 (diff)
Content fixes
Diffstat (limited to 'content/posts/now-2025-summer.md')
-rw-r--r--content/posts/now-2025-summer.md4
1 files changed, 4 insertions, 0 deletions
diff --git a/content/posts/now-2025-summer.md b/content/posts/now-2025-summer.md
index 0d687c3..81293ca 100644
--- a/content/posts/now-2025-summer.md
+++ b/content/posts/now-2025-summer.md
@@ -9,6 +9,10 @@ extra:
{{ fig(src="/files/kenrokuen.jpg", alt="A torii gate in the Kenroku-en garden") }}
+Here's three seasons of updates in one package.
+
+{{ toc() }}
+
## AutereDB project
I was reading [Designing Data-intensive Applications](https://www.oreilly.com/library/view/designing-data-intensive-applications/9781491903063/) and I came across a chapter where the author goes over log-structured database architecture. I knew about B-tree based systems, but this seemingly simpler approach was new to me. I was intrigued, but I also felt like I didn't fully grok how every cog in the theoretical database machine worked together.