Author: Abid Hasan
Posted: Mon Sep 26, 2016 9:45 pm (GMT 5.5)
Hello Juares,
Though same is already explained earlier in Mr. Woodger's post, will try putting it across again; *SORT (i.e. SYNC* or DF*) works by performing a cartesian join on keys. In your case for 3 bytes from position 4 achieved exactly this as shared in your first post. Since you had multiple matching entries ON THESE Key positions, hence a matched pair for all these records was also built by sort. Re-iterating - there are matching combinations of keys for 3 bytes from position 4.
To avoid this, you can have another key combination, i.e. 3 bytes from position 7, in conjunction to what you already have.
OR
You can use the suggestions others have already stated.
Again, the duplicates are not really duplicates, they are all 'unique combinations' if you compare them using the keys.
_________________
Thanks.
Posted: Mon Sep 26, 2016 9:45 pm (GMT 5.5)
Hello Juares,
Though same is already explained earlier in Mr. Woodger's post, will try putting it across again; *SORT (i.e. SYNC* or DF*) works by performing a cartesian join on keys. In your case for 3 bytes from position 4 achieved exactly this as shared in your first post. Since you had multiple matching entries ON THESE Key positions, hence a matched pair for all these records was also built by sort. Re-iterating - there are matching combinations of keys for 3 bytes from position 4.
To avoid this, you can have another key combination, i.e. 3 bytes from position 7, in conjunction to what you already have.
OR
You can use the suggestions others have already stated.
Again, the duplicates are not really duplicates, they are all 'unique combinations' if you compare them using the keys.
_________________
Thanks.