Access methods for text
- 1 March 1985
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Computing Surveys
- Vol. 17 (1), 49-74
- https://doi.org/10.1145/4078.4080
Abstract
This paper compares text retrieval methods intended for office systems. The operational requirements of the office environment are discussed, and retrieval methods from database systems and from information retrieval systems are examined. We classify these methods and examine the most interesting representatives of each class. Attempts to speed up retrieval with special purpose hardware are also presented, and issues such as approximate string matching and compression are discussed. A qualitative comparison of the examined methods is presented. The signature file method is discussed in more detail.Keywords
This publication has 57 references indexed in Scilit:
- Partial-match retrieval for dynamic filesBIT Numerical Mathematics, 1982
- Development of a Spelling ListIEEE Transactions on Communications, 1982
- A data base management system for document retrieval applicationsInformation Systems, 1980
- A model of cluster searching based on classificationInformation Systems, 1980
- Optimal partial-match retrievalBIT Numerical Mathematics, 1980
- Extendible hashing—a fast access method for dynamic filesACM Transactions on Database Systems, 1979
- Optimal partial-match retrieval when fields are independently specifiedACM Transactions on Database Systems, 1979
- Identifier Search Mechanisms: A Survey and Generalized ModelACM Computing Surveys, 1974
- Attribute based file organization in a paged memory environmentCommunications of the ACM, 1974
- Implementation of the substring test by hashingCommunications of the ACM, 1971