Abstract
The following combinatorial problem arising in file organization is considered: Given three sets M1, M2, M3 ⊆ X, find an arrangement of X such that each Mi is a segment of consecutive elements of X. Also some theorems extending the results of Ghosh concerning the two-dimensional consecutive retrieval property are proved. In particular, necessary and sufficient condition for a family of three sets to admit a two-dimensional organization is given.
Get full access to this article
View all access options for this article.