Can we store the whole world's data in DNA storage?

Bingzhe Li, Nae Young Song, Li Ou, David H.C. Du

Research output: Contribution to conferencePaperpeer-review

5 Scopus citations

Abstract

The total amount of data in the world has been increasing rapidly. However, the increase of data storage capacity is much slower than that of data generation. How to store and archive such a huge amount of data becomes critical and challenging. Synthetic Deoxyribonucleic Acid (DNA) storage is one of the promising candidates with high density and long-term preservation for archival storage systems. The existing works have focused on the achievable feasibility of a small amount of data when using DNA as storage. In this paper, we investigate the scalability and potentials of DNA storage when a huge amount of data, like all available data from the world, is to be stored. First, we investigate the feasible storage capability that can be achieved in a single DNA pool/tube based on current and future technologies. Then, the indexing of DNA storage is explored. Finally, the metadata overhead based on future technology trends is also investigated.

Original languageEnglish (US)
StatePublished - 2020
Event12th USENIX Workshop on Hot Topics in Storage and File Systems, HotStorage 2020, co-located withUSENIX ATC 2020 - Virtual, Online
Duration: Jul 13 2020Jul 14 2020

Conference

Conference12th USENIX Workshop on Hot Topics in Storage and File Systems, HotStorage 2020, co-located withUSENIX ATC 2020
CityVirtual, Online
Period7/13/207/14/20

Bibliographical note

Funding Information:
This work was partially supported by NSF I/UCRC Center Research in Intelligent Storage and the following NSF awards 1439622, 1525617, 1536447, and 1812537.

Publisher Copyright:
© HotStorage 2020 - 12th USENIX Workshop on Hot Topics in Storage and File Systems, co-located with USENIX ATC 2020. All rights reserved.

Fingerprint

Dive into the research topics of 'Can we store the whole world's data in DNA storage?'. Together they form a unique fingerprint.

Cite this