Partition of a query set into minimal number of subsets having consecutive retrieval property

DOI10.1016/0378-3758(77)90004-0zbMath0359.68128OpenAlexW2026669828MaRDI QIDQ1238649

Fumikazu Tamari, Noboru Hamada, Sumiyasu Yamamoto, Kazuhiko Ushio, Hideto Ikeda, Shinsei Tazawa

Publication date: 1977

Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0378-3758(77)90004-0

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Designs and configurations (05B99)

Related Items (1)

Algorithmic approach to the consecutive retrieval property

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Incidence matrices and interval graphs
• On the theory of the consecutive storage of relevant records
• Faithful Representation of a Family of Sets by a Set of Intervals
• Consecutive storage of relevant records with redundancy
• Design of a new balanced file organization scheme with the least redundancy
• File organization: Consecutive storage of relevant records on drum-type storage
• On the Consecutive Retrieval Property in File Organization
• Application of Finite Geometry in File Organization for Records with Multiple-Valued Attributes
• File organization schemes based on finite geometries
• New balanced-file organization schemes
• The Design of Combinatorial Information Retrieval Systems for Files with Multiple-Valued Attributes
• Combinatorial Information Retrieval Systems for Files
• File organization
• Design of a balanced multiple-valued filing scheme of order two based on cyclically generated spread in finite projective geometry

This page was built for publication: Partition of a query set into minimal number of subsets having consecutive retrieval property