Rev 3776: This is now the algorithm, rather than just a suggestion. in http://bzr.arbash-meinel.com/branches/bzr/1.8-dev/btree_buffer

[John Arbash Meinel]

At http://bzr.arbash-meinel.com/branches/bzr/1.8-dev/btree_buffer

------------------------------------------------------------
revno: 3776
revision-id: john at arbash-meinel.com-20081014202843-775qw8g14vdozp7t
parent: john at arbash-meinel.com-20081014202722-svyfvmyhcieabhyd
committer: John Arbash Meinel <john at arbash-meinel.com>
branch nick: btree_buffer
timestamp: Tue 2008-10-14 15:28:43 -0500
message:
  This is now the algorithm, rather than just a suggestion.
-------------- next part --------------
=== modified file 'doc/developers/btree_index_prefetch.txt'
--- a/doc/developers/btree_index_prefetch.txt	2008-10-14 19:02:26 +0000
+++ b/doc/developers/btree_index_prefetch.txt	2008-10-14 20:28:43 +0000
@@ -241,10 +241,10 @@
   very often, though.
 
 
-Suggested Algorithm
-===================
+Algorithm
+=========
 
-This is the basic outline of my suggested algorithm.
+This is the basic outline of the algorithm.
 
 1. Expand requests by requesting neighboring pages. (So if we read page 10, we
    can expand to also read page 9 and 11.)