On the construction of weighted time-optimal B-trees

DOI10.1007/BF02017342zbMATH Open0696.68033OpenAlexW1985130411MaRDI QIDQ911255FDOQ911255

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

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

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)

Cites Work

• Title not available (Why is that?)
• Optimum binary search trees
• The construction of optimal multiway search trees and the monotonicity principle
• Generalized binary split trees
• Faster construction of optimal binary split trees
• Optimal Multi-Way Search Trees
• Time- and space-optimality in B-trees
• Key Comparison Optimal 2-3 Trees with Maximum Utilization
• Minimal-Comparison $2,3$-Trees

Cited In (5)

• On batch-constructing B\(^{+}\)-trees: Algorithm and its performance evaluation
• Title not available (Why is that?)
• Execution time analysis of a top-down R-tree construction algorithm
• A new algorithm for the construction of optimal B-trees
• Title not available (Why is that?)

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)