DataTable efficiency

Alan Baljeu <[email protected]> Wed, 21 Nov 2007 09:30:39 -0500
Newsgroups gmane.comp.windows.devel.dotnet.cx
Message-ID <175901c82c4b$1745f850$1dc80ac6@CTI>
My application uses a largish readonly database (CSV files, actually) consisting of several
tables.  These tables are accessed somewhat frequently, and I want to make this as efficient
as possible.  I'm currently using plain DataTable objects produced by OdbcAdapters and
queries.     These tables are cached so I'm just searching in-memory tables after that.  My
queries look like "SELECT * FROM [{0}]" and occasionally "SELECT * FROM [{0}] where [{1}] =
'{2}'".    I'm thinking of splitting the latter into just table.Select("colname = value").

I have a nagging suspicion that the DataTable structure isn't super-efficient, or that
certain ways of using it are effcient while others aren't.

Is this so?  Are there certain things I should avoid?  Do you recommend a certain style for
efficient access?  Is there a better approach that DataTable?

===================================
This list is hosted by DevelopMentorĀ®  http://www.develop.com

View archives and manage your subscription(s) at http://discuss.develop.com