Have a personal or library account? Click to login
Efficient Dynamic Bloom Filter Hashing Fragmentation for Cloud Data Storage Cover

Efficient Dynamic Bloom Filter Hashing Fragmentation for Cloud Data Storage

Open Access
|Mar 2019

Authors

S. Jegadeeswari

jega_sathya@yahoo.co.in

Bharathiar University, Coimbatore, India

P. Dinadayalan

pdinadayalan@hotmail.com

Department of Computer Sci., Mahatma Gandhi Government Arts College, Mahe, India

D. Gnanambigai

dgnanambigai@hotmail.com

Department of Computer Sci., Indira Gandhi College of Arts and Science, India
DOI: https://doi.org/10.2478/cait-2019-0003 | Journal eISSN: 1314-4081 | Journal ISSN: 1311-9702
Language: English
Page range: 53 - 72
Submitted on: Aug 11, 2018
Accepted on: Feb 14, 2019
Published on: Mar 29, 2019
Published by: Bulgarian Academy of Sciences, Institute of Information and Communication Technologies
In partnership with: Paradigm Publishing Services
Publication frequency: 4 issues per year

© 2019 S. Jegadeeswari, P. Dinadayalan, D. Gnanambigai, published by Bulgarian Academy of Sciences, Institute of Information and Communication Technologies
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.