Key points are not available for this paper at this time.
The results of modeling the performance of searching large text databases (>10 gigabytes) via various parallel hardware architectures and search algorithms are discussed. The performance under load and the cost of each configuration are compared. Strengths, weaknesses, performance sensitivities, and search features supported for each configuration are also addressed. In addition, a common search workload used in the modeling is described. The search workload is derived from a set of searches run against the Chemical Abstracts (CA) file of bibliographic and abstract text available on STN International®. This common workload is applied to all configurations modeled to provide a common basis of comparison. © 1994 John Wiley & Sons, Inc.
Couvreur et al. (Mon,) studied this question.