A Markov chain model for dynamic binary search tree behaviour

DOI10.1080/00207160410001715311MaRDI QIDQ3155008zbMATH OpenOpenAlexFDO

Authors William E. Wright

Publication date 14 January 2005

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207160410001715311

zbMATH Keywords

B-tree

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)

Recommendations

• A model of the dynamic behavior of B-trees
• On the Markov chain for the move-to-root rule for binary search trees
• Reductions in binary search trees
• The move-to-root rule for self-organizing trees with Markov dependent requests^∗
• scientific article; zbMATH DE number 2102775

Cites work

• A model of the dynamic behavior of B-trees

Cited in

(2)

• A model of the dynamic behavior of B-trees
• Optimal parameters for search using a barrier tree Markov model

This page was built for publication: A Markov chain model for dynamic binary search tree behaviour

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