On the construction of weighted time-optimal B-trees

DOI10.1007/BF02017342zbMath0696.68033OpenAlexW1985130411MaRDI QIDQ911255

Shou-Hsuan Stephen Huang, Venkatraman Viswanathan

Publication date: 1990

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02017342

zbMATH Keywords

B-treesweighted time-optimal

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Dynamic programming (90C39) Data structures (68P05) Information storage and retrieval of data (68P20)

Related Items (1)

A new algorithm for the construction of optimal B-trees

Cites Work

• Unnamed Item
• Generalized binary split trees
• Optimum binary search trees
• Faster construction of optimal binary split trees
• The construction of optimal multiway search trees and the monotonicity principle
• Time- and space-optimality in B-trees
• Optimal Multi-Way Search Trees
• Key Comparison Optimal 2-3 Trees with Maximum Utilization
• Minimal-Comparison $2,3$-Trees

This page was built for publication: On the construction of weighted time-optimal B-trees