Re: b-tree keys per node
From: Joe \ <joe_at_bftsi0.UUCP>
Date: 2000/03/17
Message-ID: <sd562il17f248_at_corp.supernews.com>#1/1
Date: 2000/03/17
Message-ID: <sd562il17f248_at_corp.supernews.com>#1/1
"Amy Hughes" <amyhughes_at_my-deja.com> wrote in message news:8atp67$ore$1_at_nnrp1.deja.com...
> Can anyone point me toward a discussion, online or published, on
> selecting the number of keys per node in a b-tree for optimal
> performance?
Everything I've seen strongly suggests making the entire node fit within a disk page. You can still cram 14 or 15 256-byte strings and associated housekeeping into a typical 4096-byte logical page.
-- Joe Foster <mailto:jfoster_at_ricochet.net> Space Cooties! <http://www.xenu.net/> WARNING: I cannot be held responsible for the above They're coming to because my cats have apparently learned to type. take me away, ha ha!Received on Fri Mar 17 2000 - 00:00:00 CET