Advertisement

On the Relaxed Consecutive Retrieval Property in File Organization

  • Hiroshige Inazumi
  • Shigeichi Hirasawa

Abstract

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.

Keywords

Search Time Storage Location File Organization Output Alphabet Loss Tolerance 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    S.P.Ghosh, “File organization: The consecutive retrieval property,” Communications of the ACM, vol.15, no.9, pp.802–808, Sept., 1972.CrossRefMATHGoogle Scholar
  2. [2]
    A.Wakesman and M.W.Green, “On the consecutive retrieval property in file organization,” IEEE Trans, on Computers, vol.C-23, no.2, pp.173–174, Feb., 1974.CrossRefGoogle Scholar
  3. [3]
    S.P.Ghosh, “Consecutive storage of relevant with redundancy,”Communications of the ACM, vol.18, no.8, pp.464–471, Aug., 1975.CrossRefMATHGoogle Scholar
  4. [4]
    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
  5. [5]
    S.P.Ghosh, “Future of the consecutive retrieval property ,” in Data Base File Organization. Academic Press, 1983.Google Scholar
  6. [6]
    K.Tanaka, Y.Kambayashi, and S.Yajima, “Organization of quasiconsecutive retrieval files,” Information Systems, vol.4, pp.23–33, 1979.CrossRefMATHGoogle Scholar
  7. [7]
    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
  8. [8]
    J.Pearl, “On the storage economy of inferential question-answering systems,” IEEE Trans. on Syst., Man, Cybern., vol.SMC-5, no.6, pp.595–602, Nov., 1975.CrossRefGoogle Scholar
  9. [9]
    J.Pearl, “Memory versus error characteristics for inexact representations of linear orders,” IEEE Trans. on Computers, vol.C 25, no.9, pp.922–928, Sept., 1976MathSciNetCrossRefGoogle Scholar
  10. [10]
    J.Pearl,”On coding precedence relations with a pair-ordering fidelity criterion,” IEEE Trans, on Inform. Theory, vol.IT-22, no.1, pp.118–120, Jan., 1976.MathSciNetCrossRefGoogle Scholar
  11. [11]
    J.Pearl, “Theoretical bounds on the complexity of inexact representation,” IEEE Trans, on Inform. Theory, vol.IT-22, no.1, pp.118–120, Jan., 1976.MathSciNetCrossRefGoogle Scholar
  12. [12]
    A.Crolotte and J.Pearl, “Bounds on memory versus error trade-offs in question-answering systems,” IEEE Trans, on Inform. Theory, vol.IT 25, no.2, pp.193–202, Mar., 1979.MathSciNetCrossRefGoogle Scholar
  13. [13]
    A.Crolotte and J.Pearl, “Elasticity conditions for storage versus error exchange in question-answering systems,” IEEE Trans. on Inform. Theory, vol.IT-25, no.6, pp.656– 664, Nov., 1979.MathSciNetGoogle Scholar
  14. [14]
    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
  15. [15]
    H.S.Stone, ed., Introduction to computer architecture. Chicago: Science Research Associates, Inc., 1975.MATHGoogle Scholar
  16. [16]
    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
  17. [17]
    T.Berger, Rate Distortion Theory. Englewood Cliffs, NJ: Prentice-Hall, 1971.Google Scholar

Copyright information

© Plenum Press, New York 1987

Authors and Affiliations

  • Hiroshige Inazumi
    • 1
  • Shigeichi Hirasawa
    • 1
  1. 1.School of Science and EngineeringWaseda UniversityShinjuku, Tokyo 160Japan

Personalised recommendations