{"created":"2020-09-01T14:20:04.114965+00:00","id":4199,"links":{},"metadata":{"_buckets":{"deposit":"2fbcae5c-dc50-42a9-b6b9-3d3f4bd4ef3a"},"_deposit":{"id":"4199","owners":[],"pid":{"revision_id":0,"type":"recid","value":"4199"},"status":"published"},"_oai":{"id":"oai:meral.edu.mm:recid/4199","sets":["1582963302567:1597824273898"]},"communities":["ucsy"],"item_1583103067471":{"attribute_name":"Title","attribute_value_mlt":[{"subitem_1551255647225":"Data Deduplication using B+ Tree Indexing","subitem_1551255648112":"en"}]},"item_1583103085720":{"attribute_name":"Description","attribute_value_mlt":[{"interim":"As the amount of storage utilization becomelarger and larger, people have been tried to find outthe efficient ways to safe storage space. The singleinstance storage or data deduplication becomesvague in storage management as it can eliminateduplicated data or segments in those files. In thispaper, we proposed Data Deduplication System forsub-file level. This system can perform deduplicationwith the integrated use of file chunking algorithm;secure hash function and B+ tree indexing. In thissystem, we will first separate the file intovariable_length segments or chunks using TwoThresholds Two Divisors chunking algorithm.ChunkIDs are then obtained by applying hashfunction to the chunks. The resulted ChunkIDs areused to build as indexing keys in B+ tree like indexstructure. This system can reduce the indexing timecomplexity from O (n) to O (log n). The performanceof proposed system will be compared with the othersystems in terms of performance metrics such asWinZIP, WinRAR, etc."}]},"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-08-06"}],"displaytype":"preview","filename":"59002.pdf","filesize":[{"value":"59 Kb"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"url":"https://meral.edu.mm/record/4199/files/59002.pdf"},"version_id":"def250d6-4b6f-4566-9ec1-af5962fb457c"}]},"item_1583103131163":{"attribute_name":"Journal articles","attribute_value_mlt":[{"subitem_issue":"","subitem_journal_title":"Fourth Local Conference on Parallel and Soft Computing","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"},{"subitem_authors_fullname":"Thein, Ni Lar"}]}]},"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":"2009-12-30"},"item_1583159847033":{"attribute_name":"Identifier","attribute_value":"http://onlineresource.ucsy.edu.mm/handle/123456789/1893"},"item_title":"Data Deduplication using B+ Tree Indexing","item_type_id":"21","owner":"1","path":["1597824273898"],"publish_date":"2019-08-06","publish_status":"0","recid":"4199","relation_version_is_last":true,"title":["Data Deduplication using B+ Tree Indexing"],"weko_creator_id":"1","weko_shared_id":-1},"updated":"2022-03-24T23:12:02.658040+00:00"}