A review of the use of inverted files for best match searching in information retrieval systems
- 1 February 1983
- journal article
- review article
- Published by SAGE Publications in Journal of Information Science
- Vol. 6 (2-3), 59-66
- https://doi.org/10.1177/016555158300600204
Abstract
The use of inverted files for the calculation of similarity coefficients and other types of matching function is discussed in the context of mechanised document retrieval systems. A critical evaluation is presented of a range of algorithms which have been described for the matching of documents with queries. Particular attention is paid to the computational efficiency of the various procedures, and improved search heuristics are given in some cases. It is suggested that the algorithms could be implemented sufficiently efficiently to permit the provision of nearest neighbour searching as a standard retrieval option.Keywords
This publication has 21 references indexed in Scilit:
- Optimal Expected-Time Algorithms for Closest Point ProblemsACM Transactions on Mathematical Software, 1980
- Indexing exhaustivity and the computation of similarity matricesJournal of the American Society for Information Science, 1980
- On the perils of merging boolean and weighted retrieval systemsJournal of the American Society for Information Science, 1978
- Clustering large files of documents using the single‐link methodJournal of the American Society for Information Science, 1977
- THE PROBABILITY RANKING PRINCIPLE IN IRJournal of Documentation, 1977
- Finding nearest neighboursInformation Processing Letters, 1976
- On the equivalence of boolean and weighted searching based on the convertibility of query formsJournal of the American Society for Information Science, 1975
- Dynamic document processingCommunications of the ACM, 1972
- Functions of a man-machine interactive information retrieval systemJournal of the American Society for Information Science, 1971
- Inefficiency of the use of Boolean functions for information retrieval systemsCommunications of the ACM, 1961