100,000 rows is tiny, and if the desired indexes are indeed all there, it's going to be hard to guess at the problem without more detail. Initially, the query itself...

Ninja's, I actually read the article and yet still missed that. Thanks!

How did we do?

I'm aware of that, and that's the wrong method to use, as I demonstrated above with an example.

Because of the way you're calculating. The distribution of row lengths in various tables, as well as the distribution of row counts among the same tables renders your calculation useless....

I'm pretty sure you're running into the standard "parameter sniffing" problem. It's also the first thing I always look for when I hear "My stored proc is slow, but running it...

While you might have more luck in the 2005 forum, I'm confused about a small section of code above:

, ROW_NUMBER() (...

Take the row size for each table, as demonstrated in the other thread you opened on this subject, and multiply by the number of rows for that table. Sum up...

Insert the values into a table, and sum them up then, or modify a copy of that stored proc to roll them into a variable, create your own cursor to...

Either write a cursor to loop through each of your tables, or see if sp_msforeachtable will work in your situation.

Does OPENROWSET( BULK....) in combination with a FORMATFILE not work for you, or was that not an option in 2000 (it's been a while)?

Now that I look at it closer, I'm pretty sure you're right. He is wanting to completely reverse the binary digits and then process it, not do the Big Endian as...

It appears as if you are trying to do some odd form of Big Endian storage, but either I'm confused about that, or your example is wrong. If you're taking...

While that will work, it's typically preferred to use BEGIN/END to define the statement block. That way, if you decide to add additional code, it won't break again. Straight from...

If memory serves, probably an hour or two.

As an aside, is there a reason you are creating the db in advance before doing the restore?