Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!mnetor!uunet!husc6!bbn!rochester!ur-tut!ur-cvsvax!srs!dan
From: dan@srs.UUCP (Dan Kegel)
Newsgroups: comp.arch
Subject: Re: Serial Search Machines
Message-ID: <430@srs.UUCP>
Date: Fri, 30-Oct-87 11:35:32 EST
Article-I.D.: srs.430
Posted: Fri Oct 30 11:35:32 1987
Date-Received: Sun, 8-Nov-87 15:24:26 EST
References: <2667@uunet.UU.NET> <5090@utah-cs.UUCP>
Organization: S.R.Systems
Lines: 13

> In fact, there is no reason why a reasonably contructed text search machine
> can't use some form of index to reduce the amount of searching that must be
> done.

One of the big selling points of the TRW Fast Data Finder search engine
is that it can search for extremely specific things.  For instance, it
can probably handle tasks such as 'find all four-word sequences involving a 
three-letter animal name and two numbers between $4,500 and $900,000'.

I'm not sure how one would build an inverted index that would help this 
kind of search. 
On the other hand, I'm not sure who needs to run searches like that.
- Dan Kegel