Populate linking pairs: Difference between revisions
Ttenbergen (talk | contribs) |
Ttenbergen (talk | contribs) |
||
| Line 32: | Line 32: | ||
=== Algorithm === | === Algorithm === | ||
Clean our only those pairs that are questionable: | * add any new records as if all was good | ||
* delete any non-consecutive records | |||
* add any new records | |||
{{Collapsable | |||
| always= previous thoughts | |||
| full= Clean our only those pairs that are questionable: | |||
* find all records whose pairs have non-consecutive (admit dttms) | * find all records whose pairs have non-consecutive (admit dttms) | ||
** need to admit this with the old style admit dttm included so the wholesale recreation will still work | ** need to admit this with the old style admit dttm included so the wholesale recreation will still work | ||
| Line 46: | Line 52: | ||
* Delete all [[Linking pairs table]] that have non-consecutive admit dttms | * Delete all [[Linking pairs table]] that have non-consecutive admit dttms | ||
* re-populate [[Linking pairs table]] considering only D_IDs not already in [[Linking pairs table]] | * re-populate [[Linking pairs table]] considering only D_IDs not already in [[Linking pairs table]] | ||
}} | |||
== Related articles == | == Related articles == | ||