summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorGravatar Joey Hess <joeyh@joeyh.name>2015-02-17 17:09:35 -0400
committerGravatar Joey Hess <joeyh@joeyh.name>2015-02-17 17:09:35 -0400
commitc659b25a936dd50a845fc62a0789382d0b662cb3 (patch)
treee07b285c0c23a73dfc3a3c5c319e4000c21e0952
parentbaab4c2023c7bce2d4c5d7f8799e28ac59dd4583 (diff)
fix title
-rw-r--r--doc/devblog/day_253__sqlite_for_incremental_fsck.mdwn2
1 files changed, 2 insertions, 0 deletions
diff --git a/doc/devblog/day_253__sqlite_for_incremental_fsck.mdwn b/doc/devblog/day_253__sqlite_for_incremental_fsck.mdwn
index e29f2ebb1..0b5f42c79 100644
--- a/doc/devblog/day_253__sqlite_for_incremental_fsck.mdwn
+++ b/doc/devblog/day_253__sqlite_for_incremental_fsck.mdwn
@@ -1,3 +1,5 @@
+[[!meta title="day 254 sqlite for incremental fsck"]]
+
Yesterday I did a little more investigation of key/value stores.
I'd love a pure haskell key/value store that didn't buffer everything in
memory, and that allowed concurrent readers, and was ACID, and production