This paper describes the simulation of a nearest neighbour searching algorithm for document retrieval using a pool of microprocessors. The documents in a database are organised in a multi‐dimensional binary search tree, and the algorithm identifies the nearest neighbour for a query by a backtracking search of this tree. Three techniques are described which allow parallel searching of the tree. A PASCAL‐based, general purpose simulation system is used to simulate these techniques, using a pool of Transputer‐like microprocessors with three standard document test collections. The degree of speed‐up and processor utilisation obtained is shown to be strongly dependent upon the characteristics of the documents and queries used. The results support the use of pooled microprocessor systems for searching applications in information retrieval.
STEWART, M. and WILLETT, P. (1987), "NEAREST NEIGHBOUR SEARCHING IN BINARY SEARCH TREES: SIMULATION OF A MULTIPROCESSOR SYSTEM", Journal of Documentation, Vol. 43 No. 2, pp. 93-111. https://doi.org/10.1108/eb026803Download as .RIS
MCB UP Ltd
Copyright © 1987, MCB UP Limited