Bloom filter-based framework for cache management in large cloud metadata databases
by R. Anitha; Saswati Mukherjee
International Journal of High Performance Computing and Networking (IJHPCN), Vol. 10, No. 1/2, 2017

Abstract: As the data in cloud computing environment grows exponentially over the past few years, retrieving required data in shorter time becomes tedious. This paper proposes a probabilistic framework for efficient retrieval of data from huge datasets using combined approach of clustering and frequent pattern analysis using maximum frequent transaction (MFT) set algorithm based on similarity of transactions provided by a novel data structure called Bloomier matrix filter (BMF). In the proposed model clustering the metadata file is done on two levels. The first level of cluster is a base cluster which is created in an offline mode, while uploading the data based on keyword using tf-idf and second level of cluster is a derived cluster which is created in an online mode, while downloading the data. Frequent transactions are generated based on the run time statistics of the transaction provided by the Bloomier matrix filter analysis. Based on the run time statistics of the BMF the dynamic cluster is derived. We have implemented the model in a cloud environment and the experimental results shows that our approach is more efficient than the existing search technology and increases throughput by handling more number of queries efficiently with reduced latency.

Online publication date: Mon, 13-Mar-2017

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of High Performance Computing and Networking (IJHPCN):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email