Home/ Questions/Q 6347317
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Asked: 2026-05-24T21:11:26+00:00

I’m using an sql server and i have a specific table that can contain

  • 0

I’m using an sql server and i have a specific table that can contain ~1million-~10 million recrdords max.

In each record i retrieve I do some checkings (i run a few simple lines of code), and then I want to mark that the records was checked in DateTime.Now;
so what i do is retrieve a record, check some stuff, run an ‘update’ query to set the ‘last_checked_time’ field to DateTime.Now, and then move to the next record.
I can then get all the records ordered by their ‘last_checked_time’ field (ascending), and then i can iterate over them ordered by the their check time..

Is this a good practice ? Can it still remain speedy as long as i have no more than 10 million records on that table ?

I’ve read somewhere that every ‘update’ query is actually a deletion and a creation of a new record.

I’d also like to mention that these records will be frequently retrieved by my ASP.net website ..

I was thinking of writing down the ‘last_checked_time’ on a local txt file/binary file,but i’m guessing it would mean implementing something that the database can already do for you.

Share

Leave an answer

You must login to add an answer.

Need An Account,

1 Answer

  1. Editorial Team

    I would recommend retrieving your data or a portion of the data, doing your checks on all of them and sending the updates back in transactions to let the database operate more effectively. This would provide for fewer round trips.

    As to if this is a good practice, I would say yes especially since you are using in in your queries. Definitely, do not store the last checked time in a file and try to match up after you load your database data. The database RDBMS is designed to effeciently handle this for you. Don’t reinvent the wheel using cubes.

    • 0