Data manipulation and programming problems in automatic information retrieval

Authors:
G. Salton
Affiliations:
Harvard Univ., Cambridge, MA
Venue:
Communications of the ACM
Year:
1966

Citing 3
Cited 3

The SMART automatic document retrieval systems—an illustration

Communications of the ACM
Use of tree structures for processing files

Communications of the ACM
A document retrieval system for man-machine interaction

ACM '64 Proceedings of the 1964 19th ACM national conference

Information science in a Ph.D. computer science program

Communications of the ACM
Curriculum 68: Recommendations for academic programs in computer science: a report of the ACM curriculum committee on computer science

Communications of the ACM
Elements of the randomized combinatorial file structure

SIGIR '71 Proceedings of the 1971 international ACM SIGIR conference on Information storage and retrieval

Quantified Score

Hi-index	48.25

Visualization

Abstract

Automatic information retrieval programs require the manipulation of a variety of different data structures, including linear text, sparse matrices, and tree or list structures. The main data manipulations to be performed in automatic information systems are first briefly reviewed. A variety of data representations which have been used to describe structured information are then examined, and the characteristics of various processing languages are outlined in the light of the procedures requiring implementation. Advantages and disadvantages of these programming languages for the retrieval application are examined, and suggestions are made for the design of programming facilities to aid in information retrieval.