select performance, datatables or mssql2000 ?

  • Thread starter Thread starter Danny M
  • Start date Start date
D

Danny M

I am making a pre- cluster tool.

At the moment i am using a datatable to read the databases.
With help of some rules i find the records that could be double
records.
I am using datatable.select to find the records a rules find and i add
them to a new datatable with some point value to know what record has
the most chance to be double.

The only problem on 2 big tables with alot of rules the tool is very
slow.
Now my question is, did i made a design error? Should i have used
normal sql queries, direct on the database to find the records, instead
of using datatable.find?
With tempory created indexes on the fields the rules uses? If yes, how
much faster the tool will be? Now it handles like 10 records a minute.

(i am only searching on the tables)
 
If I get you correctly, you are using a DataTable object and searching it
for the data you need? If so, yes, you can save time by quering the tables.
Do not be afraid of hitting the database on queries. That is its job. Trying
to offline too much can be detrimental to perf.

--
Gregory A. Beamer
MVP; MCP: +I, SE, SD, DBA

*************************************************
Think outside of the box!
*************************************************
 
Back
Top