{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T05:42:15Z","timestamp":1778650935579,"version":"3.51.4"},"reference-count":32,"publisher":"Wiley","license":[{"start":{"date-parts":[[2021,9,10]],"date-time":"2021-09-10T00:00:00Z","timestamp":1631232000000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"National Key Research and Development Project","award":["2019YFB2102600"],"award-info":[{"award-number":["2019YFB2102600"]}]},{"name":"National Key Research and Development Project","award":["61572194"],"award-info":[{"award-number":["61572194"]}]},{"name":"National Key Research and Development Project","award":["61672233"],"award-info":[{"award-number":["61672233"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation","doi-asserted-by":"crossref","award":["2019YFB2102600"],"award-info":[{"award-number":["2019YFB2102600"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation","doi-asserted-by":"crossref","award":["61572194"],"award-info":[{"award-number":["61572194"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation","doi-asserted-by":"crossref","award":["61672233"],"award-info":[{"award-number":["61672233"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Scientific Programming"],"published-print":{"date-parts":[[2021,9,10]]},"abstract":"<jats:p>In distributed database systems, as cluster scales grow, efficiency and availability become critical considerations. In a cluster, a common approach to high availability is using replication, but this is inefficient due to its low storage utilization. Erasure coding can provide data reliability while ensuring high storage utilization. However, due to the large number of coding and decoding operations required by the CPU, it is not suitable for some frequently updated data. In order to optimize the storage efficiency of the data in the distributed system without affecting the availability of the data, this paper proposes a data temperature recognition algorithm that can distinguish data tablets and divides data tablets into three types, cold, warm, and hot, according to the frequency of access. Combining three replicas and erasure coding technology, ER-store is proposed, a hybrid storage mechanism for different data types. At the same time, we combined the read-write separation architecture of the distributed database system to design the data temperature conversion cycle, which reduces the computational overhead caused by frequent updates of erasure coding technology. We have implemented this design on the CBase database system based on the read-write separation architecture, and the experimental results show that it can save 14.6%\u201318.3% of the storage space while meeting the efficient access performance of the system.<\/jats:p>","DOI":"10.1155\/2021\/9910942","type":"journal-article","created":{"date-parts":[[2021,9,10]],"date-time":"2021-09-10T20:20:09Z","timestamp":1631305209000},"page":"1-13","source":"Crossref","is-referenced-by-count":3,"title":["ER-Store: A Hybrid Storage Mechanism with Erasure Coding and Replication in Distributed Database Systems"],"prefix":"10.1155","volume":"2021","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7260-5311","authenticated-orcid":true,"given":"Zijian","family":"Li","sequence":"first","affiliation":[{"name":"School of Software Engineering, East China Normal University, Shanghai 200062, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0716-1590","authenticated-orcid":true,"given":"Chuqiao","family":"Xiao","sequence":"additional","affiliation":[{"name":"School of Software Engineering, East China Normal University, Shanghai 200062, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","reference":[{"key":"1","doi-asserted-by":"publisher","DOI":"10.7790\/ajtde.v2n3.47"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-013-0884-0"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/tnet.2019.2938228"},{"key":"4","first-page":"199","volume-title":"The Primary-Backup Approach, Distributed Systems","author":"B. Navin","year":"1993","edition":"2nd"},{"key":"5","first-page":"91","article-title":"Chain replication for supporting high throughput and availability","author":"R. V. Renesse"},{"key":"6","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/j.jpdc.2017.02.001","article-title":"A new reliability model in replication-based big data storage systems","volume":"108","author":"J. Wang","year":"2017","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1145\/1594204.1594206"},{"key":"8","first-page":"143","article-title":"Glacier: highly durable, decentralized storage despite massive correlated failures","author":"H. Andreas"},{"key":"9","article-title":"Erasure coding in windows azure storage","author":"H. Cheng"},{"key":"10","doi-asserted-by":"crossref","first-page":"325","DOI":"10.14778\/2535573.2488339","article-title":"XORing elephants: novel erasure codes for big data","volume":"6","author":"S. Maheswaran","year":"2013","journal-title":"Proceedings of VLDB Endow"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2017.2769101"},{"key":"12","first-page":"383","article-title":"F4: Facebook\u2019s warm BLOB storage system","author":"M. Subramanian"},{"issue":"6","key":"13","first-page":"44","article-title":"Erasure Codes for Storage Systems: A Brief Primer","volume":"38","author":"J. S. Plank","year":"2013","journal-title":"Login:: The Magazine of USENIX & SAGE"},{"key":"14","first-page":"245","article-title":"E-store: fine-grained elastic partitioning for distributed transaction processing systems","volume":"3","author":"T. Rebecca","year":"2014","journal-title":"Proceedings of VLDB Endow"},{"key":"15","first-page":"351","article-title":"A building block for exascale cold data storage","author":"S. Balakrishnan"},{"key":"16","article-title":"Efficient and available in-memory KV-store with hybrid erasure coding and replication","author":"H. Zhang"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1145\/2512348"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1109\/cluster.2019.8891013"},{"issue":"2","key":"19","doi-asserted-by":"crossref","first-page":"532","DOI":"10.1109\/TCC.2018.2885306","article-title":"Demand-aware erasure coding for distributed storage systems","volume":"9","author":"J. Li","year":"2021","journal-title":"IEEE Transactions on Cloud Computing"},{"key":"20","article-title":"A solution to the network challenges of data recovery in erasure-coded distributed storage systems: a study on the Facebook warehouse cluster","author":"K. V. Rashmi"},{"key":"21","article-title":"CBase Home Page","year":"2021"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1088\/0143-0807\/30\/5\/014"},{"issue":"11","key":"23","doi-asserted-by":"crossref","first-page":"1625","DOI":"10.1016\/j.camwa.2006.05.002","article-title":"Research and performance evaluation of data replication technology in distributed storage systems","volume":"51","author":"W. Yijie","year":"2006","journal-title":"Computers & Mathematics with Applications"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1134\/s0361768820050060"},{"key":"25","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2020.3037698"},{"key":"26","article-title":"Exploiting combined locality for wide-stripe erasure coding in distributed storage","author":"Y. Hu"},{"key":"27","doi-asserted-by":"crossref","article-title":"Partial-parallel-repair(PPR): a distributed technique for repairing erasure coded storage","author":"S. Mitra","DOI":"10.1145\/2901318.2901328"},{"key":"28","first-page":"567","article-title":"Repair pipelining for erasure-coded storage","author":"R. Li"},{"key":"29","doi-asserted-by":"publisher","DOI":"10.1145\/2043556.2043560"},{"key":"30","doi-asserted-by":"publisher","DOI":"10.1137\/0108018"},{"key":"31","first-page":"23","article-title":"Consistency and fault tolerance for erasure-coded distributed storage systems","author":"P. Kathrin"},{"key":"32","article-title":"J. Pareto principle home page","author":"M. Joseph","year":"2021"}],"container-title":["Scientific Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/sp\/2021\/9910942.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/sp\/2021\/9910942.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/sp\/2021\/9910942.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,10]],"date-time":"2021-09-10T20:20:19Z","timestamp":1631305219000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.hindawi.com\/journals\/sp\/2021\/9910942\/"}},"subtitle":[],"editor":[{"given":"Jiangbo","family":"Qian","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]}],"short-title":[],"issued":{"date-parts":[[2021,9,10]]},"references-count":32,"alternative-id":["9910942","9910942"],"URL":"https:\/\/doi.org\/10.1155\/2021\/9910942","relation":{},"ISSN":["1875-919X","1058-9244"],"issn-type":[{"value":"1875-919X","type":"electronic"},{"value":"1058-9244","type":"print"}],"subject":[],"published":{"date-parts":[[2021,9,10]]}}}