Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP Path: utzoo!mnetor!seismo!lll-crg!mordor!sri-spam!ames!ucla-cs!sdcrdcf!burdvax!psuvax1!psuvm.bitnet!uh2 From: UH2@PSUVM.BITNET Newsgroups: comp.databases Subject: Re: Optimization algorithms Message-ID: <8988UH2@PSUVM> Date: Wed, 10-Dec-86 09:53:21 EST Article-I.D.: PSUVM.8988UH2 Posted: Wed Dec 10 09:53:21 1986 Date-Received: Sun, 14-Dec-86 19:07:17 EST References: <8612010047.AA14252@BORAX.LCS.MIT.EDU> 9768@sri-spam.istc.sri.com Distribution: world Lines: 12 To be honest, I am not sure I understand your proposed approach. But two practical questions come to mind. 1. Have you tried egrep? In theory it takes longer to encode the search string, but then the search is faster. 2. By adding structure to your phone book, you are gonna lose the transparent interface to other tools provided by the shell. lee