I notice that the private BO.MergeDataTables procedure uses a simple linear list for gathering PK values in order to check for duplicates. In my app, I can easily have the case of merging 10,000 rows into an existing datatable with 50,000 rows (large GIS datasets.) The O(m*n) behavior kills the performance!



If you simply switched over to using a SortedList, at least I'd get O(m*log(n)) behavior, which is OK.



Another (more dangerous) option would allow a NoCheckForDuplicates option on the BO.AppendDataTable and BO.MergeDataFrom routines, leaving duplicate PK checking in my hands.



TIA