IPFS uses decentralized file storage in terms of data storage. Different from the location addressing of the HTTP protocol, IPFS is based on content addressing. When a file is uploaded to an IPFS node for storage, the node will perform Merkle DAG (Merkle DAG) on the file. Directed Acyclic Graph (Directed Acyclic Graph) format to organize block storage. After storage, the file will be represented by the root hash number of Merkle DAG. Users can use DHT (Distributed Hash Table) from the network built by IPFS way to get the file.
01.IPFS solution for data storage
IPFS uses decentralized file storage in terms of data storage. Different from the location addressing of the HTTP protocol, IPFS is based on content addressing. When a file is uploaded to an IPFS node for storage, the node will perform Merkle DAG (Merkle DAG) on the file. Directed Acyclic Graph (Directed Acyclic Graph) format to organize block storage. After storage, the file will be represented by the root hash number of Merkle DAG. Users can use DHT (Distributed Hash Table) from the network built by IPFS way to get the file.
In addition, in terms of data storage architecture, IPFS also uses CID font technology to verify the repeatability of data. This function will help to deduplicate data on the IPFS network and ensure the uniqueness of data stored on the network. Therefore, A file with the same content cannot be submitted twice.
Such a data storage architecture can not only optimize storage requirements to a certain extent, but also improve overall network performance.
Note * What is a Merkle tree
A Merkle tree (or simply "hash tree") is a data structure in which each node is hashed. In a Merkle tree, nodes point to other nodes by their content addresses (hashes). (Remember, when we