Path: utzoo!utgpu!water!watmath!clyde!att!osu-cis!tut.cis.ohio-state.edu!mailrus!ames!elroy!cit-vax!kalra
From: kalra@cit-vax.Caltech.Edu (Devendra Kalra)
Newsgroups: comp.databases
Subject: Re: Wild Card Searches
Message-ID: <7186@cit-vax.Caltech.Edu>
Date: 7 Jul 88 16:41:57 GMT
References: <165300001@uiucdcsb> <7158@cit-vax.Caltech.Edu> <7343@elroy.Jpl.Nasa.Gov>
Reply-To: kalra@cit-vax.UUCP (Devendra Kalra)
Organization: California Institute of Technology
Lines: 17

I posted a query a few days ago about wild card searches. I think I was not
quite clear as to what I am looking for.

I am NOT looking for an algorithm to see if given a string s1 and a regular
expression s2, whether s1 and s2 match.

What I am looking for is implementation of wild card searches for data bases.
More specificaly, given n records, I want to fetch the records the mth field
of which match a given regular expression. I am looking for ways of 
organizing and accessing data records to do this in an efficient way.
I would not like to compare each record for a match. It seems to me 
that methods like hashing and index files do not work for wild card
patterns.

Any ideas?

Deven