Log in
Language:

MERAL Myanmar Education Research and Learning Portal

  • Top
  • Universities
  • Ranking
To
lat lon distance
To

Field does not validate



Index Link

Index Tree

Please input email address.

WEKO

One fine body…

WEKO

One fine body…

Item

{"_buckets": {"deposit": "442a5168-0747-48cb-9718-474cdc14cef1"}, "_deposit": {"id": "3427", "owners": [], "pid": {"revision_id": 0, "type": "recid", "value": "3427"}, "status": "published"}, "_oai": {"id": "oai:meral.edu.mm:recid/3427", "sets": ["user-ucsy"]}, "communities": ["ucsy"], "item_1583103067471": {"attribute_name": "Title", "attribute_value_mlt": [{"subitem_1551255647225": "EIMDD: Sub-file Level Data Deduplication and Recovery", "subitem_1551255648112": "en"}]}, "item_1583103085720": {"attribute_name": "Description", "attribute_value_mlt": [{"interim": "As the amounts of storage utilization becomethe vast, people are being encountered out of storagespace in almost every situation. Therefore, they tried tofind out the efficient ways to safe storage space. Thesingle instance storage or data deduplication caneliminate multiple copies of the same file andduplicated segments or chunks of data within thosefiles. Hence, data de-duplication becomes aninteresting field in storage environments especially inpersistent data storage for data centers. Current issuefor data deduplication is to avoid full-chunk indexingto identify the incoming data is new, which is timeconsuming process as it need to match every content ofone file to another. This paper, propose an EfficientIndexing Mechanism for Data Deduplication(EIMDD) and recovery system by combining the securehash algorithm and B+ tree indexing and showexperimental results tested on the extents of various filetypes except media data files. In the proposed system,it will first separate the file into variable-length chunksusing Two Thresholds Two Divisors (TTTD algorithm)chunking algorithm. ChunkIDs are then obtained byapplying secure hash function to the chunks. Theresulted ChunkIDs are used to build as indexing keysin B+ tree index structure. So the searching time forthe duplicate chunks of the files reduces from O (n) toO (log n), which can avoid the risk of full chunkindexing. Once the chunks are stored in disk, the system can reconstruct the original file, which is evendeleted, using the stored chunks and metadata,whenever the user wants. This meant the recoveryability of the proposed system."}]}, "item_1583103108160": {"attribute_name": "Keywords", "attribute_value": []}, "item_1583103120197": {"attribute_name": "Files", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_access", "date": [{"dateType": "Available", "dateValue": "2019-07-03"}], "displaytype": "preview", "download_preview_message": "", "file_order": 0, "filename": "12040.pdf", "filesize": [{"value": "1194 Kb"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_free", "mimetype": "application/pdf", "size": 1194000.0, "url": {"url": "https://meral.edu.mm/record/3427/files/12040.pdf"}, "version_id": "ab3fff88-87c3-47ad-9027-1dbd8af954cf"}]}, "item_1583103131163": {"attribute_name": "Journal articles", "attribute_value_mlt": [{"subitem_issue": "", "subitem_journal_title": "Twelfth International Conference On Computer Applications (ICCA 2014)", "subitem_pages": "", "subitem_volume": ""}]}, "item_1583103147082": {"attribute_name": "Conference papers", "attribute_value_mlt": [{"subitem_acronym": "", "subitem_c_date": "", "subitem_conference_title": "", "subitem_part": "", "subitem_place": "", "subitem_session": "", "subitem_website": ""}]}, "item_1583103211336": {"attribute_name": "Books/reports/chapters", "attribute_value_mlt": [{"subitem_book_title": "", "subitem_isbn": "", "subitem_pages": "", "subitem_place": "", "subitem_publisher": ""}]}, "item_1583103233624": {"attribute_name": "Thesis/dissertations", "attribute_value_mlt": [{"subitem_awarding_university": "", "subitem_supervisor(s)": [{"subitem_supervisor": ""}]}]}, "item_1583105942107": {"attribute_name": "Authors", "attribute_value_mlt": [{"subitem_authors": [{"subitem_authors_fullname": "Thwel, Tin Thein"}]}]}, "item_1583108359239": {"attribute_name": "Upload type", "attribute_value_mlt": [{"interim": "Publication"}]}, "item_1583108428133": {"attribute_name": "Publication type", "attribute_value_mlt": [{"interim": "Article"}]}, "item_1583159729339": {"attribute_name": "Publication date", "attribute_value": "2014-02-17"}, "item_1583159847033": {"attribute_name": "Identifier", "attribute_value": "http://onlineresource.ucsy.edu.mm/handle/123456789/118"}, "item_title": "EIMDD: Sub-file Level Data Deduplication and Recovery", "item_type_id": "21", "owner": "1", "path": ["1597824273898"], "permalink_uri": "http://hdl.handle.net/20.500.12678/0000003427", "pubdate": {"attribute_name": "Deposited date", "attribute_value": "2019-07-03"}, "publish_date": "2019-07-03", "publish_status": "0", "recid": "3427", "relation": {}, "relation_version_is_last": true, "title": ["EIMDD: Sub-file Level Data Deduplication and Recovery"], "weko_shared_id": -1}
  1. University of Computer Studies, Yangon
  2. Conferences

EIMDD: Sub-file Level Data Deduplication and Recovery

http://hdl.handle.net/20.500.12678/0000003427
http://hdl.handle.net/20.500.12678/0000003427
3bcefed8-c0d8-4812-a945-19ae03c4fea4
442a5168-0747-48cb-9718-474cdc14cef1
None
Preview
Name / File License Actions
12040.pdf 12040.pdf (1194 Kb)
Back
0
0
views
downloads
See details
Views Downloads

Versions

Ver.1 2020-09-01 10:08:43.995975
Show All versions

Share

Mendeley Twitter Facebook Print Addthis

Export

OAI-PMH
  • OAI-PMH DublinCore
Other Formats
  • JSON

Confirm


Back to MERAL


Back to MERAL