Approximating block accesses in database organizations

DOI10.1016/0020-0190(84)90101-7zbMath0542.68078OpenAlexW2021281804MaRDI QIDQ795517

Salvatore T. March, Prashant C. Palvia

Publication date: 1984

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(84)90101-7

zbMATH Keywords

physical database designblock accessesdatabase performance evaluation

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20)

Related Items (2)

Batched searching in database organizations ⋮ An urn model with applications to database performance evaluation

Cites Work

• A unifying model of physical databases
• Analysis and performance of inverted data base structures
• Storage cost considerations in secondary index selection
• Approximating block accesses in database organizations
• Doubly-chained tree data base organisation--analysis and design strategies

This page was built for publication: Approximating block accesses in database organizations