Parallel free-text search on the connection machine system
C Stanfill, B Kahle�- Communications of the ACM, 1986 - dl.acm.org
C Stanfill, B Kahle
Communications of the ACM, 1986•dl.acm.org… This article will take no stand on the issue of the relative merits of free-text versus
controlledvocabulary searching. Rather, we will present a new implementation of free-text
searching that takes advantage of the possibilities offered by a massively parallel computer,
the Connection Machine (CM), with up to 65,536 processing elements [3]. In this
implementation, the representation of the documents in memory permits a very fast … To
test the effectiveness of relevance feedback vis-i-vis the traditional Boolean search, we�…
controlledvocabulary searching. Rather, we will present a new implementation of free-text
searching that takes advantage of the possibilities offered by a massively parallel computer,
the Connection Machine (CM), with up to 65,536 processing elements [3]. In this
implementation, the representation of the documents in memory permits a very fast … To
test the effectiveness of relevance feedback vis-i-vis the traditional Boolean search, we�…
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.
ACM Digital LibraryShowing the best result for this search. See all results