Alvaro Herrera <[EMAIL PROTECTED]> writes:
> What I want to know is how different from B+-trees are PostgreSQL
> B-trees;
PG's "btrees" are in fact B+-trees according to the more formal
academic notation. IIRC the + just indicates allowing any number
of keys/downlinks in an internal tree node.
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 Programmi
Hackers,
I'm starting to read the existing algorithms for btree index shrinking.
Right now I'm at 1996 SIGMOD proceedings, Zou and Salzberg "On-line
Reorganization of Sparsely-populated B+-trees".
What I want to know is how different from B+-trees are PostgreSQL
B-trees; I've read the README in
