On the construction of weighted time-optimal B-trees

DOI10.1007/BF02017342MaRDI QIDQ911255zbMATH OpenOpenAlexFDO

Authors Shou-Hsuan S. 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

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

Recommendations

• scientific article; zbMATH DE number 753967
• Cost-optimal parallel algorithms for constructing B-trees
• Publication:5750392
• A new algorithm for the construction of optimal B-trees
• Construction of optimal binary split trees in the presence of bounded access probabilities

Cites work

• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• Faster construction of optimal binary split trees
• Generalized binary split trees
• Key Comparison Optimal 2-3 Trees with Maximum Utilization
• Minimal-Comparison $2,3$-Trees
• Optimal Multi-Way Search Trees
• Optimum binary search trees
• The construction of optimal multiway search trees and the monotonicity principle
• Time- and space-optimality in B-trees

Cited in

(5)

• On batch-constructing B\(^{+}\)-trees: Algorithm and its performance evaluation
• scientific article; zbMATH DE number 4185014 (Why is no real title available?)
• Execution time analysis of a top-down R-tree construction algorithm
• A new algorithm for the construction of optimal B-trees
• scientific article; zbMATH DE number 753967 (Why is no real title available?)

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

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