Consecutive retrieval with redundancy: An optimal linear and an optimal cyclic arrangement and their storage space requirements

DOI10.1016/0020-0190(80)90052-6MaRDI QIDQ1153695zbMATH OpenOpenAlexFDO

Authors J. ten Hoopen

Publication date 1980

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

Full work available at URL https://doi.org/10.1016/0020-0190(80)90052-6

zbMATH Keywords

file organization

Mathematics Subject Classification ID

Data structures (68P05) Information storage and retrieval of data (68P20)

Cites work

• Consecutive storage of relevant records with redundancy
• File organization
• scientific article; zbMATH DE number 3646329 (Why is no real title available?)
• scientific article; zbMATH DE number 3127542 (Why is no real title available?)
• scientific article; zbMATH DE number 3493912 (Why is no real title available?)
• scientific article; zbMATH DE number 3535613 (Why is no real title available?)
• Information storage and retrieval systems: Mathematical foundations
• On the storage space requirement of consecutive retrieval with redundancy
• On the theory of the consecutive storage of relevant records
• Polynomial Complete Consecutive Information Retrieval Problems

This page was built for publication: Consecutive retrieval with redundancy: An optimal linear and an optimal cyclic arrangement and their storage space requirements

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