a1 Department of Statistics, The George Washington University, Washington, D.C. 20052
Abstract
Via order statistics we analyze the average length of all separators in random Prefix B-trees. From this result we draw some conclusions and conjectures concerning the average overall storage of random Prefix B-trees.
Correspondence:
p1 Current address: Department of Mathematics and Computer Science, Suffolk University, Boston, MA 02114.
Footnotes
* Supported in part by NSA grant MDA904-92-H3086.