On the storage space requirement of consecutive retrieval with redundancy

DOI10.1016/0020-0190(76)90055-7zbMATH Open0327.68093OpenAlexW2019351919MaRDI QIDQ1226401FDOQ1226401

Authors: Hans-Dieter Ehrich, Witold jun. Lipski 

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

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

Cites Work

• On the theory of the consecutive storage of relevant records
• File organization
• Information storage and retrieval systems: Mathematical foundations
• Consecutive storage of relevant records with redundancy
• Polynomial Complete Consecutive Information Retrieval Problems
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (5)

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

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

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