Some Approaches to Best-Match File Searching

Communications of the ACM

Volumn 16, Issue 4, 1973, Pages 230-236

  Burkhard, W A ^a   Keller, R M ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b PRINCETON UNIVERSITY   (United States)

Author keywords

best match; file searching; file structuring; heuristics; matching

Indexed keywords

INFORMATION RETRIEVAL SYSTEMS;

FILE STRUCTURING; HEUREISTICS;

DATA PROCESSING;

EID: 0015531930     PISSN: 00010782     EISSN: 15577317     Source Type: Journal    
DOI: 10.1145/362003.362025     Document Type: Article

References (11)

1. Chang, H. Y., and Thomas, W. Methods of interpreting diagnostic data for locating faults in digital machines. Bell Syst. Tech. J. (1967), 289-317.
2. Wipke, W.T. Private communication. Dep. of Chem., Princeton U., Princeton, N.J.
3. Minsky, M., and Papert, S. Perceptrons: An Introduction to Computational Geometry M.I.T. Press, Cambridge, Mass., 1969.
4. Morris, R. Scatter storage techniques. Comm. ACM, 11, (1 Jan. 1968), 38-44.
5. Jackson, D.M. Classification, relevance, and information retrieval. Advances in Computers Vol. 11, Academic Press, N.Y., 1971.
6. Litofsky, B., and Prywes, N.S. All-automatic processing for a large library. Proc. AFIPS 1970 SJCC, Vol. 36, AFIPS Press, Montvale, N.J., pp. 323-331.
7. Salton, G. Experiments in automatic thesaurus construction for information retrieval. Proc. IFIP Congress 1971, North Holland Pub. Co., Amsterdam.
8. Augustson, J.G., and Minker, J. An analysis of some graph theoretical cluster techniques. J. ACM 17, 4 (Oct. 1970), 571-588.
9. Mulligan, C.D., and Cornell, D.G. Corrections to Bierstone's algorithm for generating cliques. J. ACM 19, 2 (Apr. 1972), 244-247.
10. Golomb, S.W. Shift Register Sequences. Holden-Day, Inc., San Francisco, 1967.
11. Bron, C., and Kerbosh, J.A.G.M. Finding all cliques of an undirected graph. (To be published.)