Parallel free-text search on the connection machine system

  • Authors:
  • Craig Stanfill;Brewster Kahle

  • Affiliations:
  • Thinking Machines Corporation, Cambridge, MA;Thinking Machines Corporation, Cambridge, MA

  • Venue:
  • Communications of the ACM - Special issue on parallelism
  • Year:
  • 1986

Quantified Score

Hi-index 0.08

Visualization

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.