Speeding Up Searching In B-cloud System

With the enormous growth in data amount day by day storage demands have beenimposed crucial requirements for data center, where data access plays essential role inestimation of data storage systems effectiveness. For that, there were a lot of efforts havebeen done to speed up searching in huge storage systems. Deduplication, one of the latesttechnologies in storage systems world, is founded on the principle of eliminatingduplicates among data. Although this technology led to reduce vast amount of redundantdata, still the matter of accessing speed of this huge amount of data is a critical problem.In this research a simple method was proposed to speed up searching in B-Cloud systemby adopting one technical tool named Least Recently Used algorithm LRU which is ableto save vast amount of time and speed up accessing time clearly. The Least Recently Usedalgorithm is based on the principle that elements that have been frequently demanded inthe last few queries will probably be frequently demanded again in the next few times.The experiments results have shown that back up/recovery time decreased with the size ofdata and there is clear enhancement in both recovery and back up time (where back uptime decreased15.67%with16KB cache size and34.14%with8MB cache size andrecovery time decreased15.69%with16KB cache size and32.3%with8MB cache size),which led to enhance enormously the overall system performance.