THE SQL Server Blog Spot on the Web

Welcome to SQLblog.com - The SQL Server blog spot on the web Sign in | |
in Search

Page Free Space

See also my SQL Server technical articles on SQLperformance.com

SQL Server, Seeks, and Binary Search

Published Tuesday, August 9, 2011 10:10 AM by Paul White

Comment Notification

If you would like to receive an email when updates are made to this post, please register here

Subscribe to this post's comments using RSS

Comments

 

Rob Farley said:

Nice, Paul.

August 8, 2011 5:11 PM
 

Paul White said:

Cheers, Rob.

August 8, 2011 5:20 PM
 

Dylan said:

Fascinating read as always!

August 8, 2011 5:23 PM
 

Alexander Kuznetsov said:

Paul,

This is a brilliant post, of course, but I am not completely with you on the following: "Linear interpolation has the potential to be more efficient even than binary search" - there are some exceptions when a slow but reliable binary search converges much faster than its smarter alternatives.

August 9, 2011 12:00 AM
 

csm said:

Great. It's always a pleasure read articles like this.

August 9, 2011 3:17 AM
 

tobi said:

Who would have guessed this explanation?

August 9, 2011 7:27 AM
 

Paul White said:

@Alex: Agreed, and that's why I said "has the potential".  There is much more detail in the papers referenced at the end of the post.

@csm: Thank you

@tobi: I didn't hear from anyone that guessed correctly.  Perhaps I should have offered a prize ;c)

August 9, 2011 11:50 AM
 

amit said:

its 2 gud dude................

September 10, 2012 2:59 AM
 

Boris Hristov said:

Insanely great article, Paul!

April 17, 2013 3:24 AM

Leave a Comment

(required) 
(required) 
Submit
Privacy Statement