Merkle Tree with real world examples скачать в хорошем качестве

Merkle Tree with real world examples

Merkle Trees are used in popular software applications like Git, Amazon Dynamo DB and BlockChain. A merkle tree is a metadata-structure, which stores the hash of the combined children in each parent. Any change in a child requires a change in the parent node. This property of identifying state changes is useful when validating the correctness of data, as calculating the inverse of a hash is computationally infeasible. The merkle tree's properties are suitable for applications where a malicious user must be stopped from changing data. Git file creation details: Git registers any change in a file as an entirely new file. It stores the content of the file with a filename of SHA1(fileContents). Let's say this SHA1(fileContents) = x. If x already exists in the git file system, it doesn't go ahead and create it. This avoids unnecessary recreations when metadata about a file is changed. When a file is modified in Git, git creates a new (changed)file, and all it's changed parents. The root subsequently changes. It's like a branch of a Persistent Data Structure. If you want to go back a commit, you use the root of the previous commit, which still points to the old file. In this way, Git takes snapshots of every point of change in the project. Perfect for a version control system. It is also useful to find the points at which the data has changed, using a Merkle Tree. Amazon Dynamo DB uses merkle trees to reduce entropy (Anti-entropy technique) when a new node is added to the Dynamo DB cluster. Amazon Dynamo DB data migration details: When copying a range assigned to a node, we have to allow concurrent updates to keep the service available. But when the migration is in progress, concurrent updates lead to stale data in the destination node. So we copy the data range multiple times. When there is no change in the two nodes, we declare the destination node as consistent. Since we want this to happen as fast as possible, we try to minimise the number of copy iterations. The procedure is explained in the video. System Design Playlist:    • System Design Playlist   Become a channel member!    / @gkcs   References: Git: https://stackoverflow.com/questions/4... Consistent Hashing:    • What is CONSISTENT HASHING and Where is it...   NoSQL:    • Introduction to NoSQL databases   Amazon DB: https://www.allthingsdistributed.com/... Anti Entropy without Merkle Trees: https://haslab.uminho.pt/tome/files/d... You can follow me on: Facebook:   / gkcs0   Quora: https://www.quora.com/profile/Gaurav-... LinkedIn:   / gaurav-sen-56b6a941   Twitter:   / gkcs_