Efficiency of text scanning in bibliographic databases using microprocessor-based, multiprocessor networks
- 1 December 1988
- journal article
- Published by SAGE Publications in Journal of Information Science
- Vol. 14 (6) , 335-345
- https://doi.org/10.1177/016555158801400604
Abstract
This paper reports an evaluation of the efficiency of text scanning achievable from a microprocessor-based, multi processing system which uses Inmos transputers. The Boyer-Moore pattern matching algorithm was used to search 35 natural language quenes against a file of 1000 titles and abstracts taken from the Library and Information Science Ab stracts database. A model of searching using a singly-linked chain containing up to 11 transputers was carried out: the maximum speed-up obtained with this size of network was 10.4 with a processor utilization of 0.95, both figures being close to the ideal of 11.0 and 1.0. Expenments with a nearest neighbour searching algorithm for serial document files demonstrate the need to keep the processors fully occupied with computational work if a high degree of speed-up is to be obtained.Keywords
This publication has 26 references indexed in Scilit:
- Identifying 3D maximal common substructures using transputer networksJournal of Molecular Graphics, 1987
- Parallel free-text search on the connection machine systemCommunications of the ACM, 1986
- Algorithms for pattern matchingSoftware: Practice and Experience, 1986
- Nearest neighbour searching in serial files using text signaturesJournal of Information Science, 1985
- An investigation of different string coding methodsJournal of the American Society for Information Science, 1984
- String searching in text editorsSoftware: Practice and Experience, 1982
- The practicality of text signatures for accelerating string searchingSoftware: Practice and Experience, 1982
- A comparison of three string matching algorithmsSoftware: Practice and Experience, 1982
- Criteria for choosing subsets to obtain maximum relative entropyThe Computer Journal, 1978
- Implementation of the substring test by hashingCommunications of the ACM, 1971