Associative/parallel processors for searching very large textual data bases
R. M. Bird, J. C. Tu, R. M. Worthy · 1977
This paper describes an approach to solving a major problem in the information processing sciences— that of searching very large (5-50 billion characters) data bases of unstructured free-text for random queries within a reasonable time and at an affordable price.