Dataset search performance question

[Jeff Wilson]

Am relatively new to .NET and am trying to use it to create a usage
billing system that can process a million or two records each day. Am
currently using a simple system written in C that uses hash tables to
look up all the information necessary to bill each record.

My question is, If I use a DataSet to maintain all the various lookup
tables involved in billing each record (some are small, some have
100,000 records), can accessing records out of these tables be as fast
as using simple hash tables in memory? Are indexes in the datasource
migrated and used in the DataSet?

Are there other less obvious tips/tricks for getting the fastest
possible search access out of DataSets?

Thanks for your advice.

Jeff

[Sijin Joseph]

No. (I don't think datatables will be as fast as hashtables, plus the
memory overhead is going to be huge) Although even a hashtable is not
too good, you can consider using a BST for your lookup table.

http://msdn.microsoft.com/library/de...res_guide4.asp

No., indexes are not copied from the datasource.

Sijin Joseph
http://www.indiangeek.net
http://weblogs.asp.net/sjoseph

Jeff Wilson wrote:

Am relatively new to .NET and am trying to use it to create a usage
billing system that can process a million or two records each day. Am
currently using a simple system written in C that uses hash tables to
look up all the information necessary to bill each record.

My question is, If I use a DataSet to maintain all the various lookup
tables involved in billing each record (some are small, some have
100,000 records), can accessing records out of these tables be as fast
as using simple hash tables in memory? Are indexes in the datasource
migrated and used in the DataSet?

Are there other less obvious tips/tricks for getting the fastest
possible search access out of DataSets?

Thanks for your advice.

Jeff