S Fox wrote:Well if nobody will fix the db for you, I thought of a hack way you can maybe do this. You'd basically have to make your own class for a db record... FName, Lname, all that. Then put these into a hashset for query1. do the same for each query. Youll probably need to make a comparator for testing records equality on those 5 points of reference. This should let you iterate through q1 hs and ask does it contain any record from q2 hs, and if it does then you can pull those out into sub-sets of the data by sticking them into a new hs.
Dave Tolls wrote:So, when you say "there are 5 points of reference that need to be matched up" is that a fixed set of 5 columns?
So in your table with 10 (+) columns, you only need to compare the same 5?
Can you give a fuller example?
Because to me that looks like a single query, so I'm clearly missing something.
All of the world's problems can be solved in a garden - Geoff Lawton. Tiny ad:
RavenDB is an Open Source NoSQL Database that’s fully transactional (ACID) across your databasehttps://coderanch.com/t/704633/RavenDB-Open-Source-NoSQL-Database