"B-trees and databases, past and future", in Broy, M., Dennett, E. (ed.),
Software Pioneers, Berlin Germany, Springer-Verlag, 2002, pp. 232-244.
230 ;;Quote: each B-tree level increases size by 400x; at most two physical I/O per operation due to caching highest levels
242 ;;Quote: B-trees widely used to implement relational database systems; primary commercial application
ThesaHelp: references a-b (396 items)
Topic: b-trees (16 items)
Topic: trees (21 items)
Topic: database keys and indexing (18 items)