A Document Storage Method Based on Polarized Distance

ABSTRACT

Some elementary mathematical properties of term matching document retrieval systems are developed. These properties are used as a basis for a new file organization technique. Some of the advantages of this new method are (1) the key-to-address transformation is easily determined; (2) the documentary information is stored only once in the file; (3) the file organization allows the use of various matching functions and thresholds; and (4) the dimensionality of the transform is easily expanded to accommodate various sized data bases.

REFERENCES

• 1: ABRAHAM, C. T., GHOSH, S. P., AND RAY CHAUDURI, D.K. File organization schemes based on finite geometries. Inform. and Contr. 15, 2 (Feb. 1968), 143-163.
• 2: BUCHHOLZ, W. File organization and addressing. IBM Syst. J. 2 (June 1963), 86-111.
• 3: CHIEN, R. T., AND PREPARATA, F.P. Search strategy and file organization in computerized information retrieval systems with mass memory. In Mechanized information, Storage, Retrieval, and Dissemination, K. Samuelson, Ed., North-Holland Publishing Co., Amsterdam, 1968, pp. 108-121.
• 4: CHow, D.K. A geometric approach to coding theory with application to information retrieval. Rep. R-368, Coordinated Science Lab., U. of Illinois, Urbana, Ill., Oct. 1967.
• 5: D. R. Davis , A. D. Lin, Secondary key retrieval using an IBM 7090-1301 system, Communications of the ACM, v.8 n.4, p.243-246, April 1965 [doi>10.1145/363831.364908]
• 6: Ivan Flores, Data Structure and Management, Prentice Hall PTR, Upper Saddle River, NJ, 1977
• 7: Kul~NS, j.L. On the continuum of coefficients of association. In Statistical Association Methoda for Mechanized Documentation, M. E. Stevens, V. E. Giuliano, and M. E. Stevens, Eds., National Bureau of Standards Misc. Pub. 269, 1965, pp. 33-39.
• 8: HANAN, M., AND PALERMO, F.P. An application of coding theory to a file address problem. IBM J. Res. Devel. 7, 2 (April 1963), 127-129.
• 9: Barry Litofsky, Utility of automatic classification systems for information storage and retrieval, 1969
• 10: V. Y. Lum , P. S. T. Yuen , M. Dodd, Key-to-address transform techniques: a fundamental performance study on large existing formatted files, Communications of the ACM, v.14 n.4, p.228-239, April 1971 [doi>10.1145/362575.362578]
• 11: MARCUS, M.P. Minimum polarized distance codes. IBM J. Res. Devel. 5, 3 (July 1961), 241-248.
• 12: MARK, E. A. Document Retrieval Systems. Rep.' R-543, Coordinated Science Lab., U. of Illinois, Urbana, Ill., Jan. 1972, 110 pp.
• 13: ROM~RIO, G. F., et al. Statistical analysis of concept coordination documentation systems. US Navy Tech. Rep. N69-22798, 1969.
• 14: Gerard. Salton, Automatic Information Organization and Retrieval., McGraw Hill Text, 1968
• 15: SCHAY, G., ANn RAVEn, N. A method for key-to-address transformations. IBM J. Res. Develop. 7, 2 (April 1963), 121-126.
• 16: WARHEIT, I.A. File organization for information retrieval. In Mechanized Information Storage, Retrieval, and Disseminations, K. Samuelson, Ed., North-Holland Publishing Co., Amsterdam, 1968, pp. 259-268.

INDEX TERMS

Primary Classification:
  H. Information Systems
  H.3 INFORMATION STORAGE AND RETRIEVAL
      H.3.3 Information Search and Retrieval
          Subjects: Retrieval models

Additional Classification:
  H. Information Systems
  H.3 INFORMATION STORAGE AND RETRIEVAL
      H.3.1 Content Analysis and Indexing
          Subjects: Indexing methods

General Terms:
Documentation, Management, Measurement, Performance, Theory, Verification