On the storage space requirement of consecutive retrieval with redundancy

DOI10.1016/0020-0190(76)90055-7zbMath0327.68093OpenAlexW2019351919MaRDI QIDQ1226401

Witold jun. Lipski, Hans-Dieter Ehrich

Publication date: 1976

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

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

Mathematics Subject Classification ID

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

Related Items (5)

Once more on storage for consecutive retrieval ⋮ Consecutive retrieval with redundancy: An optimal linear and an optimal cyclic arrangement and their storage space requirements ⋮ Storage for consecutive retrieval ⋮ On strings containing all subsets as substrings ⋮ On the consecutive retrieval property for generalized binary queries

Cites Work

• Unnamed Item
• Unnamed Item
• Information storage and retrieval systems: Mathematical foundations
• On the theory of the consecutive storage of relevant records
• Consecutive storage of relevant records with redundancy
• Polynomial Complete Consecutive Information Retrieval Problems
• File organization

This page was built for publication: On the storage space requirement of consecutive retrieval with redundancy