Fast Search in Ordered Name List
Original Publication Date: 1989-Nov-01
Included in the Prior Art Database: 2005-Jan-29
This method provides a rapid means of searching for a given name in a sorted directory of names, e.g., the telephone books. The method does not need hashing tables or steering files. Binary search algorithms can perform the required search with a number of read operations bounded by log base 2 (N), where N is the number of names. The proposed hybrid method is based on linear inverse interpolation and the binary search, and requires typically 40 per cent fewer read operations than a binary search.