Hello!

I recommend two good sources of information in English:

http://www.nist.gov/dads/ further look for balanced trees and kins

(BTW, there is some other interesting algorithms alike patricia).

and well-known Donald Knuth's monography, namely, volume 3. (I mean
"The Art of Computer Programming".)

its description can be found at
http://www-cs-faculty.stanford.edu/~knuth/taocp.htm

You can also look at how MUMPS (where B+trees is the "heart" of
DBMS) handles B+trees if curious:

http://math-cs.cns.uni.edu/~okane/cgi-bin/newpres/index.cgi?array=lib&ml=2&a1=1002+Mumps+Language+Research&a2=1011+The+Mumps+Language

-- 
WBR, Yury Bokhoncovich, Senior System Administrator, NOC of F1 Group.
Phone: +7 (3832) 106228, ext.140, E-mail: byg@center-f1.ru.
Unix is like a wigwam -- no Gates, no Windows, and an Apache inside.



Fri, 13 Sep 2002 11:08:48 +0700 (NOVST)
Yury Bokhoncovich <byg@center-f1.ru>
btree page merging