Dataset search performance question

  • Thread starter Thread starter Jeff Wilson
  • Start date Start date
J

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
 

Ask a Question

Want to reply to this thread or ask your own question?

You'll need to choose a username for the site, which only take a couple of moments. After that, you can post your question and our members will help you out.

Ask a Question

Back
Top