On the Relaxed Consecutive Retrieval Property in File Organization
In the information retrieval systems, the consecutive retrieval property first defined by S.P. Ghosh is an important relation between a set of queries and a set of records. Its existence enables the design of the system with a minimal search time and no redundant storage. However, the consecutive retrieval property cannot exist between every arbitrary query set and every record set unless the duplication of records are allowed. We consider the file organization satisfying the relaxed consecutive retrieval property which tolerates both the loss of search time and the redundancy of records, and determine the relationships between these parameters by rate-distortion theoretic approach. The result indicates that it is worthwhile to search for algorithms that will generate the storage locations satisfying the relaxed consecutive retrieval property, when the system size becomes sufficiently large.
Unable to display preview. Download preview PDF.
- S.Yamamoto, K.Ushio, S.Tazawa, H.Ikeda, F.Tamari, and N.Hamada, “Partition of query set into minimal number of subsets having consecutive retrieval property,” J. of Statistical Planning and Inference, no.1, pp.41–51, 1977.Google Scholar
- S.P.Ghosh, “Future of the consecutive retrieval property ,” in Data Base File Organization. Academic Press, 1983.Google Scholar
- Y.Kambayashi, “The buffer limited quasi-consecutive retrieval file organization and its application to logic circuit layout,” in Data Base File Organization. Academic Press, 1983.Google Scholar
- H.Inazumi and S.Hirasawa, “Memory versus error trade-offs in binary-valued retrieval problems,” IEEE Trans. on Syst., Man, Cybern., vol.SMC-14, no.5, Sept., 1984.Google Scholar
- C.E.Shannon, “Coding theorems for a discrete source with a fidelity criterion,” 1959 IRE Nat. Conv. Rec., pt.4, pp.142–163.Google Scholar
- T.Berger, Rate Distortion Theory. Englewood Cliffs, NJ: Prentice-Hall, 1971.Google Scholar