Novel approach for search engine

Abstract

This is well known that IoT needs intelligent search engines to manage big data processing. We have been developing such issues with novel algorithms. CAM (Contents Addressable Memory) conducts high speed searching with high power consumption which is not productive. The LUT (Look Up Table) algorithm with certain software is one type of method that is utilized to save power and commonly found in today. However there is possibility of a reduced search speed it using the sequential software method. The method used in our study produces high speed searching with low power due to the address-to-data search algorithm on LUT when compared with the regular data-to-address step. This reversal approach has considered historically. However address collisions occur prolifically and could not be a zero-based probability. In the study of our algorithm developed a zero-based probability process which is accomplished by key data division and only division data searching steps resulted in high speed and low power output.