A New Effcient Files Retrieval System Using Caching Search Engine
Mohammed Khaleel Hussein, Hazem Mokhtar El-Bakry, Ahmed Abdelfattah Saleh · 2016
Profitable cloud file search systems have to route client queries over massive Web indexes under certain stretched limitations. In training phase, to get low latency, massive outcomes are working and a segment of the query transfer is provided using earlier computed outcomes. In addition, file search systems are required to revise their indexes regularly in order to integrate modifications to the cloud. After each key change in database, the signification of cache entries may turn into old, thus reducing the newness of served outcomes. In this paper, a proposed framework which called Fast File Retrieval System (FFRS) is proposed. Such framework manipulates problems in caching. This is to achieve scalability in file explore systems and the ability to handle the changes in index. Furthermore, a new method that uses a (TTL) time-to-live amount and frequently used value is introduced. The idea is to set cache entrance to select revives cached outcomes by concerning revive queries to back-end search groups from database. Then sorting the entrances to be identified is performed according to the number of admittance with the age of a record in the cache. Moreover, to set the rate at which revive demands are mattered, a novel method that takes inactive cycles of execution servers is presented. Assessment using real data illustrates that the proposed framework can realize hit rate enhancement efficiently.