{"_buckets": {"deposit": "70bc1598-9f5d-44b6-bd2d-0b4bd0cb3c35"}, "_deposit": {"created_by": 45, "id": "6702", "owner": "45", "owners": [45], "owners_ext": {"displayname": "", "username": ""}, "pid": {"revision_id": 0, "type": "depid", "value": "6702"}, "status": "published"}, "_oai": {"id": "oai:meral.edu.mm:recid/00006702", "sets": ["user-uit"]}, "communities": ["uit"], "item_1583103067471": {"attribute_name": "Title", "attribute_value_mlt": [{"subitem_1551255647225": "Using Bloom Filter Array (BFA) to Speed up the Lookup in Distributed Storage System", "subitem_1551255648112": "en"}]}, "item_1583103085720": {"attribute_name": "Description", "attribute_value_mlt": [{"interim": "Today’s storage systems have a major issue for the long-term\nstorage of massive amounts of unstructured data. The\nreliability and availability of that fortune of data become\nimportant factors. So, distributed storage system is essential\nfor many large-scale organizations. It is challenging that how\nto access the distributed data from a place. In this paper, a\nstructure of the Bloom filter array (BFA) is proposed to get\ntime and space efficiency in distributed storage system. The\nproposed structure that can efficiently lookup the queries will\nbe discussed from the algorithm perspective and then evaluate\nBFA through simulations."}]}, "item_1583103108160": {"attribute_name": "Keywords", "attribute_value_mlt": [{"interim": "Unstructured data"}, {"interim": "large-scale distributed storage"}, {"interim": "replication"}, {"interim": "availability"}, {"interim": "reliability"}, {"interim": "bloom filter"}]}, "item_1583103120197": {"attribute_name": "Files", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_access", "date": [{"dateType": "Available", "dateValue": "2020-12-09"}], "displaytype": "preview", "download_preview_message": "", "file_order": 0, "filename": "Using Bloom Filter Array (BFA) to Speed up the Lookup in Distributed Storage System.pdf", "filesize": [{"value": "318 Kb"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "mimetype": "application/pdf", "size": 318000.0, "url": {"url": "https://meral.edu.mm/api/files/70bc1598-9f5d-44b6-bd2d-0b4bd0cb3c35/Using%20Bloom%20Filter%20Array%20%28BFA%29%20to%20Speed%20up%20the%20Lookup%20in%20Distributed%20Storage%20System.pdf"}, "version_id": "05976192-805b-45d9-b654-401436fa0e2a"}]}, "item_1583103131163": {"attribute_name": "Journal articles", "attribute_value_mlt": [{"subitem_journal_title": "International Journal of Computer Applications (0975 – 8887)", "subitem_pages": "26-28", "subitem_volume": "Volume 60– No.11"}]}, "item_1583105942107": {"attribute_name": "Authors", "attribute_value_mlt": [{"subitem_authors": [{"subitem_authors_fullname": "Myat Pwint Phyu"}, {"subitem_authors_fullname": "Ni Lar Thein"}]}]}, "item_1583108359239": {"attribute_name": "Upload type", "attribute_value_mlt": [{"interim": "Publication"}]}, "item_1583108428133": {"attribute_name": "Publication type", "attribute_value_mlt": [{"interim": "Journal article"}]}, "item_1583159729339": {"attribute_name": "Publication date", "attribute_value": "2012-12-03"}, "item_title": "Using Bloom Filter Array (BFA) to Speed up the Lookup in Distributed Storage System", "item_type_id": "21", "owner": "45", "path": ["1596102355557"], "permalink_uri": "https://meral.edu.mm/records/6702", "pubdate": {"attribute_name": "Deposited date", "attribute_value": "2020-12-09"}, "publish_date": "2020-12-09", "publish_status": "0", "recid": "6702", "relation": {}, "relation_version_is_last": true, "title": ["Using Bloom Filter Array (BFA) to Speed up the Lookup in Distributed Storage System"], "weko_shared_id": -1}