An analysis of performance and cost factors in searching large text databases using parallel search systems

T. R. Couvreur, R. N. Benzel, S. F. Miller, D. N. Zeitler, D. L. Lee, M. Singhal, N. Shivaratri and W. Y. P. Wong

Journal of the American Society for Information Science, 1994, vol. 45, issue 7, 443-464

Abstract: 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.

Date: 1994
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/(SICI)1097-4571(199408)45:73.0.CO;2-O

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:bla:jamest:v:45:y:1994:i:7:p:443-464

Ordering information: This journal article can be ordered from
https://doi.org/10.1002/(ISSN)1097-4571

Access Statistics for this article

More articles in Journal of the American Society for Information Science from Association for Information Science & Technology
Bibliographic data for series maintained by Wiley Content Delivery ().