IDEAS home Printed from https://ideas.repec.org/a/jbh/ijsrcs/v9y2023i10idhcseit2361014.html

Optimized Data Storage Using Sharding Method in Block Chain

Author

Listed:
  • V. S. Nalawade
  • Aniket Chavan
  • Prathamesh Palve
  • Omkar Salunkhe

Abstract

The sharding scheme is highly useful and an effective mechanism to improve the storage and improve the volume of the database. Majority of the data being stored across the world is stored in conventional techniques in servers and workstations. As the amount of data keeps increasing every single day, these systems need to be able to scale up and allow for more data storage within the existing infrastructure. This is a big challenge as the conventional approaches are not as effective in achieving the scaling of the storage infrastructure with certain limitations that are inherent towards a centralized implementation of the databases. Therefore, the utilization of the decentralized sharding mechanism can help in achieving effective scalability and improved volume of the storage. The conventional approaches for the purpose of achieving the scaling of the existing database architecture are not sufficient for the current influx of data. Data nowadays has increased in value and volume that demands for an improvement in the infrastructure to be able to store more data efficiently and with improved security.

Suggested Citation

  • V. S. Nalawade & Aniket Chavan & Prathamesh Palve & Omkar Salunkhe, 2023. "Optimized Data Storage Using Sharding Method in Block Chain," International Journal of Scientific Research in Computer Science, Engineering and Information Technology, International Journal of Scientific Research in Computer Science, Engineering and Information Technology, vol. 9(10), pages 82-86, October.
  • Handle: RePEc:jbh:ijsrcs:v9:y2023:i10:id:hcseit2361014
    Note: Article URL: https://ijsrcseit.com/CSEIT2361014
    as

    Download full text from publisher

    File URL: https://ijsrcseit.com/CSEIT2361014
    File Function: Article URL
    Download Restriction: no

    File URL: https://ijsrcseit.com/paper/CSEIT2361014.pdf
    File Function: Full text
    Download Restriction: no
    ---><---

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    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:jbh:ijsrcs:v9:y2023:i10:id:hcseit2361014. 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: Pankaj Sharma (USA) (email available below). General contact details of provider: https://ijsrcseit.com/home .

    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.