Optimum data base reorganization points

DOI10.1145/362248.362267MaRDI QIDQ3212647zbMATH OpenOpenAlexWikidataFDO

Authors 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

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

Cited in

(5)

• 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

This page was built for publication: Optimum data base reorganization points

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