J
Jamie Risk
I have two tables in my database that refer to a third database
to look up geographical location (as in "Ontario", "New York",
"New Jersey" etc.)
The first two tables contain groups of people that I wish to
match according to their locations. As an example I'd like to
match somebody in Kansas with people in Nebraska, Missouri,
Oklahoma, and Colorado.
I'm thinking the solution will involve the creation of a fourth
table [StateNeighbours] with two significant fields in it
([StateNeighbours.State] and [StateNeighbours.Neighbour], each
being a lookup up to the existing [State] table.
It would easy enough to design the database so that for every
state, I would require all the neighbours be listed in
[StateNeighbours]. This would create redundant information in
my database though:
State Neighbour
... ...
Kansas Colorado
Kansas Arkansas
... ...
Colorado Kansas <- Redundant entry
In reality my '[State]' is a list of 400 locations.
How would I design the DB to avoid entering redundant
information AND consequently extract all that information?
Thanks,
- Jamie
to look up geographical location (as in "Ontario", "New York",
"New Jersey" etc.)
The first two tables contain groups of people that I wish to
match according to their locations. As an example I'd like to
match somebody in Kansas with people in Nebraska, Missouri,
Oklahoma, and Colorado.
I'm thinking the solution will involve the creation of a fourth
table [StateNeighbours] with two significant fields in it
([StateNeighbours.State] and [StateNeighbours.Neighbour], each
being a lookup up to the existing [State] table.
It would easy enough to design the database so that for every
state, I would require all the neighbours be listed in
[StateNeighbours]. This would create redundant information in
my database though:
State Neighbour
... ...
Kansas Colorado
Kansas Arkansas
... ...
Colorado Kansas <- Redundant entry
In reality my '[State]' is a list of 400 locations.
How would I design the DB to avoid entering redundant
information AND consequently extract all that information?
Thanks,
- Jamie