jump to navigation

Single Table Hash Selects Investigated May 30, 2009

Posted by mwidlake in performance.
Tags: ,
2 comments

I think I mentioned in an earlier post that Piet de Visser had posted a nice example of the fastest way to select a single row, via a single table hash cluster. Well, I somehow missed his followup until now (I think because he has two blogs and I was checking the other one).

This is the follow up and he once again provides scripts to repeat his tests. What a nice chap. He shows how care in setting up the hash cluster is a good idea.

Here’s looking forward to his next long train trip so he can add to this thread. I might even spot it sooner next time!

Follow

Get every new post delivered to your Inbox.

Join 156 other followers