The ideal search

Abstract

There are various types of search techniques developed so far for searching the numbers, searching strings and others. Searching in large database containing huge collection of data is done (in most of the cases) using numerical indexes. Though there are many efficient search methods available still they are not ideal. The ideal search is the one that performs search in constant time, i.e. O(1). Till now this case is considered impossible but still we can achieve a performance very close to it using hash table. But this “The Ideal Search” can search any integer number among billions of numbers at constant O(1) time.