Skip to main content
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

Cybernetics and Information Technologies
Volume 19 (2019): Issue 1 (March 2019)
By: S. Jegadeeswari,  P. Dinadayalan and  D. Gnanambigai  
Open Access
|Mar 2019
Articles in this issue
DOI: https://doi.org/10.2478/cait-2019-0003 | Journal eISSN: 1314-4081 | Journal ISSN: 1311-9702
Journal RSS Feed
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
Keywords:
Cloud data storage,
Cloud users,
security,
Confidentiality,
fragmented table,
unfragmented table,
Bloom filter
Related subjects:
Computer sciences,
Information technology

© 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.

Volume 19 (2019): Issue 1 (March 2019)
Previous article
Next article