aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorBen Johnson <benbjohnson@yahoo.com>2014-01-21 16:16:17 -0700
committerBen Johnson <benbjohnson@yahoo.com>2014-01-21 16:16:17 -0700
commitc56c2fe1657f8f501d19ff00f92e806e2173981d (patch)
treea4b828effc6ccca10590c346c34e2e9e9ab9d859
parentUpdate README.md (diff)
downloaddedo-c56c2fe1657f8f501d19ff00f92e806e2173981d.tar.gz
dedo-c56c2fe1657f8f501d19ff00f92e806e2173981d.tar.xz
Update README.md
-rw-r--r--README.md8
1 files changed, 8 insertions, 0 deletions
diff --git a/README.md b/README.md
index d7590dd..5e7474a 100644
--- a/README.md
+++ b/README.md
@@ -156,6 +156,14 @@ err := c.DeleteString("foo")
The Bolt database is meant to be a clean, readable implementation of a fast single-level key/value data store.
This section gives an overview of the basic concepts and structure of the file format.
+### B+ Tree
+
+Bolt uses a data structure called an append-only B+ tree to store its data.
+This structure allows for efficient traversal of data.
+
+TODO: Explain better. :)
+
+
### Pages
Bolt stores its data in discrete units called pages.