Some average performance measures for the B-tree
From MaRDI portal
Publication:797287
DOI10.1007/BF00289710zbMATH Open0545.68054OpenAlexW1978071187MaRDI QIDQ797287FDOQ797287
Authors: William E. Wright 
Publication date: 1985
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00289710
Recommendations
indexesfile organizationaverage performance measuresaverage storage utilizationlarge B-treesmultiway trees
Information storage and retrieval of data (68P20) Data structures (68P05) Searching and sorting (68P10)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- On random 2-3 trees
- Title not available (Why is that?)
- Organization and maintenance of large ordered indexes
- Space utilization and access path length in B-trees
- Storage utilization in B*-trees with a generalized overflow technique
- B-trees re-examined
Cited In (13)
- \(B\)-trees with inserts and deletes: Why free-at-empty is better than merge-at-half
- Title not available (Why is that?)
- A model of the dynamic behavior of B-trees
- Expected behaviour of \(B^+\)-trees under random insertions
- A uniform model for the storage utilization of B-tree-like structures
- The average height of a node in the BANG abstract directory tree
- Title not available (Why is that?)
- Toward a formal derivation of the expected behavior of prefix B-trees
- Title not available (Why is that?)
- Height-balanced trees of order (β, γ, δ)
- Memory management for B-trees
- Space saving generalization of \(B\)-trees with \(2/3\) utilization
- Variance of storage requirements for B+-trees
This page was built for publication: Some average performance measures for the B-tree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q797287)
