Abstract
A data structure for a plant pathology thesaurus is implemented as a continuous string of characters. A hashing function is used to access terms and their related terms. A prefix hashing schema is described which permits thesaurus file access with partial spellings and defines file blocking to improve sequential (alphabetic) scans. Sequential searches within blocks permit full word matching when desired. A general system and file structure is proposed with display formats and a user command language.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
J. Rickman, “Automatic storage and retrieval techniques for large on-line abstract collections,” Ph.D. Thesis, Washington State University, 1972.
P. C. Mitchell, “The system design of an on-line interactive document retrieval system and the general utility of the design techniques,” Ph.D. Thesis, Washington State University, 1971.
F. W. Lancaster,Information Retrieval Systems: Characteristics Testing, and Evaluation (Wiley, New York, 1968).
C. W. Cleverdon and E. M. Keen, “Factors determining the performance of indexing systems,” inASLIB: The Cranfield (England) Research Project Report, 1 and 2 (1966).
H. P. Burnaugh, “The BOLD (bibliographic on-line display) system,” inIR—A Critical Review, G. Scheeler, Ed., (Thompson Book Co., Washington, D.C., 1967), pp. 53–66.
Donald E. Knuth,The Art of Computer Programming (Addison-Wesley, Reading, Massachusetts, 1968), pp. 351–357.
Evan Flores,Data Structure and Management (Prentice-Hall, Englewood Cliffs, New Jersey, 1970), pp. 336–338.
G. Salton,Automatic Information Organization and Retrieval (McGraw-Hill, New York, 1968), pp. 68–69, 97–108.
C. E. Price, “Table lookup techniques,”Computing Surveys (ACM Publication)3(2):49–65 (1971).
V. Y. Lum, P. S. T. Yuen, and M. Dodd, “Key-to-address transform techniques: A fundamental performance study of large existing formatted files,”Commun. ACM 14(4):228–239 (1971).
Werner, Buchholz, “File organization and addressing,”IBM Syst. J. 2(June):86–111 (1963).
W. W. Peterson, “Addressing for random-access storage,”IBM J. Res. Dev. 1(2): 130–146 (1957).
IBM Corp., “IBM system/360 component descriptions—2814 and associated DASD,” Form A26-3599, IBM Systems Development Division, Product Publications, San Jose, California, Dept. G24, 1969.
Robert Morris, “Scatter storage techniques,”Commun. ACM 11(1):38–44 (1968).
W. D. Maurer, “An improved hash code for scatter storage,”Commun. ACM 11(1): 35–38 (1968).
Author information
Authors and Affiliations
Additional information
This research was supported in part by cooperative funds from the Intermountain Forest and Range Experiment Station, Forest Service, U. S. Department of Agriculture, and Washington State University, Pullman, Washington.
This paper was presented at the ACM Special Interest Group on Information Retrieval, Symposium on Data Structures in Information Retrieval held in Atlantic City, New Jersey, May 17, 1972.
Rights and permissions
About this article
Cite this article
Rickman, J., Walden, W.E. Structures for an interactive on-line thesaurus. International Journal of Computer and Information Sciences 2, 115–127 (1973). https://doi.org/10.1007/BF00976058
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF00976058