Toward a formal derivation of the expected behavior of prefix B-trees

DOI10.1017/S0269964800003776MaRDI QIDQ2805318zbMATH OpenFDO

Authors Hosam M. Mahmoud, Ratko Orlandić

Publication date 11 May 2016

Published in Probability in the Engineering and Informational Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S0269964800003776

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• Some average performance measures for the B-tree
• Expected behaviour of \(B^+\)-trees under random insertions
• A model of the dynamic behavior of B-trees
• Digital search trees with keys of variable length
• Random suffix search trees

Cites work

• Generalized Digital Trees and Their Difference—Differential Equations
• scientific article; zbMATH DE number 53861 (Why is no real title available?)
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 3513051 (Why is no real title available?)
• On random 2-3 trees
• Organization and maintenance of large ordered indexes
• Page usage in a quadtree index
• The Joint Distribution of Elastic Buckets in Multiway Search Trees

Cited in

(3)

• An algebraic approach to the prefix model analysis of binary trie structures and set intersection algorithms
• STORAGE OVERHEAD OF O-TREES, B-TREES AND PREFIX B-TREES: A COMPARATIVE ANALYSIS
• Some average performance measures for the B-tree

This page was built for publication: Toward a formal derivation of the expected behavior of prefix B-trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2805318)