ACM Home Page
Please provide us with feedback. Feedback
Parallel free-text search on the connection machine system
Full text PdfPdf (1.04 MB)
Source
Communications of the ACM archive
Volume 29 ,  Issue 12  (December 1986) table of contents
Special issue on parallelism
Pages: 1229 - 1239  
Year of Publication: 1986
ISSN:0001-0782
Authors
Craig Stanfill  Thinking Machines Corporation, Cambridge, MA
Brewster Kahle  Thinking Machines Corporation, Cambridge, MA
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 8,   Downloads (12 Months): 29,   Citation Count: 56
Additional Information:

abstract   references   cited by   index terms   review   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/7902.7907
What is a DOI?

ABSTRACT

A new implementation of free-text search using a new parallel computer—the Connection Machine®—makes possible the application of exhaustive methods not previously feasible for large databases.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
2
 
3
 
4
 
5
Kraay. T. Unpublished manuscript. MRJ, Fairfax, Va., Apr. 1986.
 
6
Mott, P.M., Waltz, D.L., Resnikoff, H.L., and Robertson, G.G. Automatic indexing of text. Tech. Rep. 86-1, Thinking Machines Corp.. Cambridge. Mass.. Jan. 1986.
7
8
 
9
 
10
11
 
12
van Rijsbergen, C.J. It@mhor~ Retrieval. 2nd ed. Butterworths, London, 1979.

CITED BY  56


REVIEW

"Santosh Chokhani : Reviewer"

As the title suggests, this paper describes techniques to exploit parallelism of the Connection Machine for free-text search algorithms while searching natural-language documents contained in large databases, ranging from a few megabytes to a fe  more...

Collaborative Colleagues:
Craig Stanfill: colleagues
Brewster Kahle: colleagues