aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorBen Johnson <benbjohnson@yahoo.com>2015-12-05 20:27:15 -0700
committerBen Johnson <benbjohnson@yahoo.com>2015-12-05 20:27:15 -0700
commitf27abf2cc7fc695b13a06b0d6d7149125730b35b (patch)
tree289ff085147f0196149bc21f7a74228a258fb783
parentMerge pull request #463 from rhcarvalho/fix-stats (diff)
downloaddedo-f27abf2cc7fc695b13a06b0d6d7149125730b35b.tar.gz
dedo-f27abf2cc7fc695b13a06b0d6d7149125730b35b.tar.xz
README
Replace reference to the coalescer with a reference to `DB.Batch()`. Fixes #465.
-rw-r--r--README.md5
1 files changed, 2 insertions, 3 deletions
diff --git a/README.md b/README.md
index 627181e..8f48400 100644
--- a/README.md
+++ b/README.md
@@ -588,9 +588,8 @@ It's important to pick the right tool for the job and Bolt is no exception.
Here are a few things to note when evaluating and using Bolt:
* Bolt is good for read intensive workloads. Sequential write performance is
- also fast but random writes can be slow. You can add a write-ahead log or
- [transaction coalescer](https://github.com/boltdb/coalescer) in front of Bolt
- to mitigate this issue.
+ also fast but random writes can be slow. You can use `DB.Batch()` or add a
+ write-ahead log to help mitigate this issue.
* Bolt uses a B+tree internally so there can be a lot of random page access.
SSDs provide a significant performance boost over spinning disks.