I am concerned with hash as a bad primary key. But no choice.
Calling program have limitaions to provide person's info as XML to store, and then send the person's XML to search for any existing record.
Maintaining the consistency of XML that was passed while insert and sending the same XML for search is responsibility of calling application/program.
Plus by using a algorithm while hashing, and then using the same algorithm while serach/compare... Do you think still there can be issues?
Also if any other better solution if you can suggest would be appreciated.
Thanks
Deepak
My advice would be to extract the person's data from the xml and store that in columns in the database.
Then do exactly the same for a query - extract the data from the xml for the primary key and then lookup in your database table.
Hashing the xml and using that is just horrible IMHO and will almost certainly let you down.
MM
select geometry::STGeomFromWKB(0x0106000000020000000103000000010000000B0000001000000000000840000000000000003DD8CCCCCCCCCC0840000000000000003DD8CCCCCCCCCC08408014AE47E17AFC3F040000000000104000CDCCCCCCCCEC3F9C999999999913408014AE47E17AFC3F9C99999999991340000000000000003D0000000000001440000000000000003D000000000000144000000000000000400400000000001040000000000000F03F100000000000084000000000000000401000000000000840000000000000003D0103000000010000000B000000000000000000143D000000000000003D009E99999999B93F000000000000003D009E99999999B93F8014AE47E17AFC3F400000000000F03F00CDCCCCCCCCEC3FA06666666666FE3F8014AE47E17AFC3FA06666666666FE3F000000000000003D1800000000000040000000000000003D18000000000000400000000000000040400000000000F03F000000000000F03F000000000000143D0000000000000040000000000000143D000000000000003D, 0);
Viewing 8 posts - 1 through 7 (of 7 total)
You must be logged in to reply to this topic. Login to reply