Mathmatical Genious Needed for this tough question
Author Message
Mathmatical Genious Needed for this tough question

I have a table of 350,000 names,adress, phone etc.. What I'm trying to
do is find all the relationships within the file and group them together
under one pseudokey.  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.  The main file has an autonumber.  Any suggestions would be
greatly appreciated it.

Sat, 12 May 2001 03:00:00 GMT
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

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

--

Sat, 12 May 2001 03:00:00 GMT

 Page 1 of 1 [ 2 post ]

Relevant Pages