Login
Register
Reset Password
Publish & Distribute
Publishing Solutions
Distribution Solutions
Subjects
Publications
Journals
Books
Proceedings
Publishers
Blog
Contact
Search
Cart
EUR
USD
GBP
English
English
Deutsch
Polski
Español
Français
Italiano
Home
Journals
Cybernetics and Information Technologies
Volume 19 (2019): Issue 1 (March 2019)
Open Access
Efficient Dynamic Bloom Filter Hashing Fragmentation for Cloud Data Storage
S. Jegadeeswari
S. Jegadeeswari
,
P. Dinadayalan
P. Dinadayalan
and
D. Gnanambigai
D. Gnanambigai
| Mar 29, 2019
Cybernetics and Information Technologies
Volume 19 (2019): Issue 1 (March 2019)
About this article
Previous Article
Next Article
Abstract
References
Authors
Articles in this Issue
Preview
PDF
Cite
Share
Published Online:
Mar 29, 2019
Page range:
53 - 72
Received:
Aug 11, 2018
Accepted:
Feb 14, 2019
DOI:
https://doi.org/10.2478/cait-2019-0003
Keywords
Cloud data storage
,
Cloud users
,
security
,
Confidentiality
,
fragmented table
,
unfragmented table
,
Bloom filter
© 2019 S. Jegadeeswari et al., published by Sciendo
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.