Optimum data base reorganization points

DOI10.1145/362248.362267zbMath0269.68022OpenAlexW2104039347WikidataQ128253363 ScholiaQ128253363MaRDI QIDQ3212647

Ben Shneiderman

Publication date: 1973

Published in: Communications of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/362248.362267

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) General topics in the theory of software (68N01)

Related Items

Multidimensional B-trees: Analysis of dynamic behavior ⋮ Optimum reorganization points for arbitrary database costs ⋮ Toward a theory of encoded data structures and data translation ⋮ A model for optimizing indexed file structures ⋮ Hashing with overflow indexing