Answers are grounded in this paper and cite their sources.
Most B-tree papers assume that all N keys have the same size K, that F = B/K keys fit in a disk block, and therefore that the search cost is O(logf+1 N) block transfers. When keys have variable size, however, B-tree operations have no nontrivial performance guarantees.
No takes yet. Share an insight, caveat, or question.
Bender et al. (2010) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: