Mathmatical Genious Needed for this tough question

On Tue, 24 Nov 1998 12:45:15 -0500, Steve Eill

Quote:

>So what I'm doing is making tables by find

>duplcates on phone in one table, addr1, city, state in another table

>etc... My question is if a record could be in 1 to n groupings what

>would be the most efficient way to find all the recurssions and assign a

>psuedo key.

Don't think this is particularly mathematical... but I'm not sure

exactly what help you want either :-)

If you mean, how do you find how many groups of cities, etc you have,

you would use a SELECT DISTINCT City FROM MyMegaTable;

If you want groups of combinations, do the same thing, as in SELECT

DISTICT City, State FROM MyMegaTable

If you _have_ to chop this thing up into bits, the INTO clause will

help: SELECT ALL * INTO YorkTable WHERE City = "York";

Does that help?

Tim Ferguson

--