IDEAS home Printed from https://ideas.repec.org/a/gam/jftint/v15y2023i6p212-d1169010.html
   My bibliography  Save this article

Research on Blockchain Data Availability and Storage Scalability

Author

Listed:
  • Honghao Si

    (College of Information and Computer, Taiyuan University of Technology, Taiyuan 030600, China)

  • Baoning Niu

    (College of Information and Computer, Taiyuan University of Technology, Taiyuan 030600, China)

Abstract

Blockchain adopts a chain data structure, and the characteristics of blocks that can only be added and cannot be deleted make the total number of blocks accumulate over time, forcing resource-constrained nodes to become degraded nodes in order to alleviate increasingly severe storage pressure. Degraded nodes only store partial blocks, although improving the scalability of blockchain storage and reducing data redundancy will lead to a decrease in data availability. To address the problem of storage scalability, quantitative research is needed on data availability. Based on a summary of the existing definitions of data availability, we propose a definition of data availability for blockchain. By analyzing the data synchronization process and the transaction lifecycle, key factors affecting data availability were extracted, and a data availability measurement model was constructed based on node types. On this basis, a relationship model linking data availability and storage scalability was constructed to find the range of data redundancy that meets the target data availability. The experimental results indicate that the data availability measurement model for blockchain can measure the data availability levels of different scalable storage schemes. The model of the relationship between data availability and storage scalability can guide the setting of data redundancy in scalable storage schemes.

Suggested Citation

  • Honghao Si & Baoning Niu, 2023. "Research on Blockchain Data Availability and Storage Scalability," Future Internet, MDPI, vol. 15(6), pages 1-16, June.
    • Handle: RePEc:gam:jftint:v:15:y:2023:i:6:p:212-:d:1169010
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/1999-5903/15/6/212/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/1999-5903/15/6/212/
    Download Restriction: no
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jftint:v:15:y:2023:i:6:p:212-:d:1169010. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.