title: Looking for a disk-bound b-tree example
body: <p>Maybe my google-foo just isn't up to snuff, but I'm wanting to play with a b-tree alogrithm that is bound to disk. Since most tutorials and examples are on-memory, they assume random access memory in which changing nodes in a tree is simple enough, but other than rather I/O intensive rewriting or using memory-mapped files, I can't think of a good approach.</p>
  
  <p>Theory would be fine, C# or Java would be even better.</p>
  
  <p><strong>EDIT:</strong> I apologize for the lack of clarity. I am not looking for a product or code base to use, but an example or illustrative codebase to better understand how one would go about building a disk-backed b-tree.</p>