‌

US Patent 11928085 Using merkle trees in any point in time replication

Overview Structured Data Issues Contributors

Is a

1

Patent attributes

Patent Jurisdiction

United States Patent and Trademark Office

1

Patent Number

Patent Inventor Names

Alex Solan1

Jehuda Shemer1

Date of Patent

March 12, 2024

1

Patent Application Number

167131461

Date Filed

December 13, 2019

1

Patent Citations

US Patent 11055351 Frequent pattern mining on a frequent hierarchical pattern tree

1

US Patent 10250679 Enabling snapshot replication for storage

1

US Patent 10671639 Selectively replicating changes to hierarchial data structures

1

US Patent 7437601 Method and system for re-synchronizing an asynchronous mirror without data loss

1

US Patent 8224935 Systems and methods for efficiently synchronizing configuration data within distributed computing systems

1

US Patent 8260742 Data synchronization and consistency across distributed repositories

1

US Patent 8345707 Method for synchronizing data maintained at a plurality of nodes

1

US Patent 9418131 Synchronization of volumes

1

...

Patent Primary Examiner

Tyler J Torgrimson

1

CPC Code

1

1

1

1

1

1

1

Patent abstract

One example method includes performing various operations while a stream of IOs is being applied to a source dataset and replicated to a target dataset, and the operations include receiving a replicated IO that was previously applied to a source dataset Merkle tree, applying the replicated IO to a target dataset Merkle tree by entering an updated hash value in the target dataset Merkle tree, and applying a timestamp to the target dataset Merkle tree.

Timeline

No Timeline data yet.

Further Resources

Title

Author

Link

Type

Date

No Further Resources data yet.

References

Find more entities like US Patent 11928085 Using merkle trees in any point in time replication

Use the Golden Query Tool to find similar entities by any field in the Knowledge Graph, including industry, location, and more.

Open Query Tool

Golden Query Tool

By using this site, you agree to our Terms of Service.