Good morning/afternoon and happy holidays.
I have a process in which a set of data is loaded to a database each month. The new file is appended to an accumulative file which is the main table in the database. Each record contains an Application Number, Loan Number and File Date field (among others). Occasionally a record will come accross with the same application or loan number as another record that was added already to the database. In this case, the analyst would like to see the most recent record (the one from the latest monthly file) kept, and the older record discarded.
My plan was to run a find dup query on both the application number and on the loan number after the monthly append, and then identify the record with the Max file date from that subset. I've been able to get this far, but now I can't come up with a logical way to get the Max file date dup records, and all the records with no dups assembled together in a table again.
Does anyone have any experience with this and, if so, can you provide me with a possible solution?
Thanks in advance for any assistance you can provide.
Neeko
I have a process in which a set of data is loaded to a database each month. The new file is appended to an accumulative file which is the main table in the database. Each record contains an Application Number, Loan Number and File Date field (among others). Occasionally a record will come accross with the same application or loan number as another record that was added already to the database. In this case, the analyst would like to see the most recent record (the one from the latest monthly file) kept, and the older record discarded.
My plan was to run a find dup query on both the application number and on the loan number after the monthly append, and then identify the record with the Max file date from that subset. I've been able to get this far, but now I can't come up with a logical way to get the Max file date dup records, and all the records with no dups assembled together in a table again.
Does anyone have any experience with this and, if so, can you provide me with a possible solution?
Thanks in advance for any assistance you can provide.
Neeko