Modified binary searching for static tables

We consider a new method to retrieve keys in a static table. The keys of the table are stored in such a way that a binary search can be performed more efficently. An analysis of the method is performed and empirical evidence is given that it actually works.