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

DOI10.1017/S0269964800003776zbMATH Open1335.68075MaRDI QIDQ2805318FDOQ2805318

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)

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

Mathematics Subject Classification ID

Data structures (68P05)

Cites Work

• Title not available (Why is that?)
• On random 2-3 trees
• Title not available (Why is that?)
• Title not available (Why is that?)
• Organization and maintenance of large ordered indexes
• Generalized Digital Trees and Their Difference—Differential Equations
• The Joint Distribution of Elastic Buckets in Multiway Search Trees
• Page usage in a quadtree index

Cited In (2)

• An algebraic approach to the prefix model analysis of binary trie structures and set intersection algorithms
• 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)