Map
Index
Random
Help
th

Quote: each B-tree level increases size by 400x; at most two physical I/O per operation due to caching highest levels

topics > all references > references a-b > QuoteRef: bayeR_2002 , p. 230



Topic:
trees
Topic:
b-trees

Quotation Skeleton

In practical terms … increasing your database size by a facto of … increases enough to cache one additional layer of … almost all B-Trees require less than 4 logical … [up to 512 GB]. The top part of a B-tree index excluding the two … cached. [FIXUP: verify] Therefore: all elementary operations require at …   Google-1   Google-2

Copyright clearance needed for quotation.


Related Topics up

Topic: trees (21 items)
Topic: b-trees (16 items)

Copyright © 2002-2008 by C. Bradford Barber. All rights reserved.
Thesa is a trademark of C. Bradford Barber.