Algorithmic approach to the consecutive retrieval property

[[abstract]]Ghosh's consecutive retrieval property (CR property) not only represents an elegant file organization, but also raises the problem of how to construct such a file with this property. Ghosh used an n×m0-1 incidence matrix, where n is the number of records and m is the number of queries, as tool for constructing a file with the CR property. In this paper the rows and columns of the incidence matrix are restricted to unique 0-1 patterns. It is found that such a unique incidence matrix cannot have the CR property if the number of rows is greater than 2m-1. This upper bound can be used to generate m(2m-1) columns, which form all the matrices with the CR property that may correspond to the given matrix. Two algorithms are presented which map the columns of the given incidence matrix to these columns with consecutive 1's. A proposed implementation in terms of data base design is also presented[[fileno]]2030204010031[[department]]資訊工程學