From 4bd032680d8b277c5c7d11621b95237f1ad5ceaa Mon Sep 17 00:00:00 2001 From: Josh Baker Date: Thu, 21 Jul 2016 18:48:09 -0700 Subject: [PATCH] mention btree implementation --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/README.md b/README.md index d3869e5..3dec94e 100644 --- a/README.md +++ b/README.md @@ -149,7 +149,7 @@ There is also `AscendGreaterOrEqual`, `AscendLessThan`, `AscendRange`, `Descend` ## Custom Indexes -Initially all data is stored in a single [B-tree](https://en.wikipedia.org/wiki/B-tree) with each item having one key and one value. All of these items are ordered by the key. This is great for quickly getting a value from a key or [iterating](#iterating) over the keys. +Initially all data is stored in a single [B-tree](https://en.wikipedia.org/wiki/B-tree) with each item having one key and one value. All of these items are ordered by the key. This is great for quickly getting a value from a key or [iterating](#iterating) over the keys. Feel free to take a peruse at the [B-tree implementation](https://github.com/tidwall/btree) that BuntDB uses. You can also create custom indexes that allow for ordering and [iterating](#iterating) over values. A custom index also uses a B-tree, but it's more flexible because it allows for custom ordering.