MERAL Myanmar Education Research and Learning Portal
Item
{"_buckets": {"deposit": "0eadba1e-8da3-4ca0-9aba-a446c9475135"}, "_deposit": {"created_by": 45, "id": "6286", "owner": "45", "owners": [45], "owners_ext": {"displayname": "", "username": ""}, "pid": {"revision_id": 0, "type": "recid", "value": "6286"}, "status": "published"}, "_oai": {"id": "oai:meral.edu.mm:recid/6286", "sets": ["user-uit"]}, "communities": ["uit"], "item_1583103067471": {"attribute_name": "Title", "attribute_value_mlt": [{"subitem_1551255647225": "Automatic Adjustment of Read Consistency Level of Distributed Key-value Storage by a Replica Selection Approach", "subitem_1551255648112": "en"}]}, "item_1583103085720": {"attribute_name": "Description", "attribute_value_mlt": [{"interim": "In distributed key-value storage systems, Apache Cassandra is known for its scalability and fault tolerance. In such systems, Cassandra is a peer-to-peer architecture which any user can connect to any node in any data center and can read and write data anywhere. Most of the systems usually select a fixed number of replicas for read/write requests in key-value storage. When the more replicas a read request chooses, it may increase the response time and reduce the system performance. In this paper, a consistent replica selection approach is proposed to automatically select number of consistent replicas by defining the read and write consistency level. This approach searches the nearest replicas and selects the consistent replicas depending on the current time, nearest arrival time, read/write latency and version for each read request. The proposed approach tends to achieve the read/write performance of client requests for key-value storage system by reducing the read/write execution time, latency cost and storage cost."}]}, "item_1583103108160": {"attribute_name": "Keywords", "attribute_value_mlt": [{"interim": "Consistent Replicas"}, {"interim": "Consistency Level"}, {"interim": "Key-value storage"}]}, "item_1583103120197": {"attribute_name": "Files", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_access", "date": [{"dateType": "Available", "dateValue": "2020-11-19"}], "displaytype": "preview", "download_preview_message": "", "file_order": 0, "filename": "Automatic Adjustment of Read Consistency Level of Distributed Key-value Storage by a Replica Selection Approach.pdf", "filesize": [{"value": "1.4 Mb"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensefree": "© 2017 ICAIT", "licensetype": "license_free", "mimetype": "application/pdf", "size": 1400000.0, "url": {"url": "https://meral.edu.mm/record/6286/files/Automatic Adjustment of Read Consistency Level of Distributed Key-value Storage by a Replica Selection Approach.pdf"}, "version_id": "6fb438f6-4fd0-4de8-a3fb-59ea073a4eab"}]}, "item_1583103147082": {"attribute_name": "Conference papers", "attribute_value_mlt": [{"subitem_acronym": "ICAIT-2017", "subitem_c_date": "1-2 November, 2017", "subitem_conference_title": "1st International Conference on Advanced Information Technologies", "subitem_place": "Yangon, Myanmar", "subitem_session": "Mobile and Distributed Computing", "subitem_website": "https://www.uit.edu.mm/icait-2017/"}]}, "item_1583105942107": {"attribute_name": "Authors", "attribute_value_mlt": [{"subitem_authors": [{"subitem_authors_fullname": "Thazin Nwe"}, {"subitem_authors_fullname": "Tin Tin Yee"}, {"subitem_authors_fullname": "Myat Pwint Phyu"}, {"subitem_authors_fullname": "Ei Chaw Htoon"}, {"subitem_authors_fullname": "Junya Nakamura"}]}]}, "item_1583108359239": {"attribute_name": "Upload type", "attribute_value_mlt": [{"interim": "Publication"}]}, "item_1583108428133": {"attribute_name": "Publication type", "attribute_value_mlt": [{"interim": "Conference paper"}]}, "item_1583159729339": {"attribute_name": "Publication date", "attribute_value": "2017-11-02"}, "item_title": "Automatic Adjustment of Read Consistency Level of Distributed Key-value Storage by a Replica Selection Approach", "item_type_id": "21", "owner": "45", "path": ["1605779935331"], "permalink_uri": "http://hdl.handle.net/20.500.12678/0000006286", "pubdate": {"attribute_name": "Deposited date", "attribute_value": "2020-11-19"}, "publish_date": "2020-11-19", "publish_status": "0", "recid": "6286", "relation": {}, "relation_version_is_last": true, "title": ["Automatic Adjustment of Read Consistency Level of Distributed Key-value Storage by a Replica Selection Approach"], "weko_shared_id": -1}
Automatic Adjustment of Read Consistency Level of Distributed Key-value Storage by a Replica Selection Approach
http://hdl.handle.net/20.500.12678/0000006286
http://hdl.handle.net/20.500.12678/000000628676bd7ca9-2481-4ef5-a1ed-0becde10d0de
0eadba1e-8da3-4ca0-9aba-a446c9475135
Name / File | License | Actions |
---|---|---|
![]() |
© 2017 ICAIT
|
Publication type | ||||||
---|---|---|---|---|---|---|
Conference paper | ||||||
Upload type | ||||||
Publication | ||||||
Title | ||||||
Title | Automatic Adjustment of Read Consistency Level of Distributed Key-value Storage by a Replica Selection Approach | |||||
Language | en | |||||
Publication date | 2017-11-02 | |||||
Authors | ||||||
Thazin Nwe | ||||||
Tin Tin Yee | ||||||
Myat Pwint Phyu | ||||||
Ei Chaw Htoon | ||||||
Junya Nakamura | ||||||
Description | ||||||
In distributed key-value storage systems, Apache Cassandra is known for its scalability and fault tolerance. In such systems, Cassandra is a peer-to-peer architecture which any user can connect to any node in any data center and can read and write data anywhere. Most of the systems usually select a fixed number of replicas for read/write requests in key-value storage. When the more replicas a read request chooses, it may increase the response time and reduce the system performance. In this paper, a consistent replica selection approach is proposed to automatically select number of consistent replicas by defining the read and write consistency level. This approach searches the nearest replicas and selects the consistent replicas depending on the current time, nearest arrival time, read/write latency and version for each read request. The proposed approach tends to achieve the read/write performance of client requests for key-value storage system by reducing the read/write execution time, latency cost and storage cost. | ||||||
Keywords | ||||||
Consistent Replicas, Consistency Level, Key-value storage | ||||||
Conference papers | ||||||
ICAIT-2017 | ||||||
1-2 November, 2017 | ||||||
1st International Conference on Advanced Information Technologies | ||||||
Yangon, Myanmar | ||||||
Mobile and Distributed Computing | ||||||
https://www.uit.edu.mm/icait-2017/ |